Conflicts in Policy-Based Distributed Systems Management
IEEE Transactions on Software Engineering
Information and Computation - Special issue on EXPRESS 1997
XML document security based on provisional authorization
Proceedings of the 7th ACM conference on Computer and communications security
An efficient security verification method for programs with stack inspection
CCS '01 Proceedings of the 8th ACM conference on Computer and Communications Security
Introduction to Automata Theory, Languages and Computability
Introduction to Automata Theory, Languages and Computability
Automata theory for XML researchers
ACM SIGMOD Record
EDBT '00 Proceedings of the 7th International Conference on Extending Database Technology: Advances in Database Technology
Conflict Detection and Resolution in Access Control Policy Specifications
FoSSaCS '02 Proceedings of the 5th International Conference on Foundations of Software Science and Computation Structures
Efficient Algorithms for Model Checking Pushdown Systems
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
Author-X: A Java-Based System for XML Data Protection
Proceedings of the IFIP TC11/ WG11.3 Fourteenth Annual Working Conference on Database Security: Data and Application Security, Development and Directions
XML access control using static analysis
Proceedings of the 10th ACM conference on Computer and communications security
Taxonomy of XML schema languages using formal language theory
ACM Transactions on Internet Technology (TOIT)
RTA'06 Proceedings of the 17th international conference on Term Rewriting and Applications
| Hi-index | 0.00 |
Recently, an access control for XML database is one of the key issues in database security. Given an access control policy and a query expression, static analysis determines whether the query does not access any elements nor attributes that are prohibited by the access control policies. In a related work, policies and queries were modeled as regular sets of paths in trees. However, this model loses information on the structure of the trees, and some policies cannot be represented by the model accurately. In this paper, we propose a formal model for access control of XML databases and provide a static analysis method based on tree automata theory. Both an access control policy and a query are modeled as tree automata, and a policy is provided with two alternative semantics; AND-semantics and OR-semantics. We investigate the computational complexity of the static analysis problem, and show that the problem in AND-semantics is solvable in square time while the problem in OR-semantics is EXPTIME-complete.