Computer Science – Databases
Scientific paper
2007-08-15
Computer Science
Databases
25 pages. To appear in Proceedings of DBPL 2007
Scientific paper
XML access control policies involving updates may contain security flaws, here called inconsistencies, in which a forbidden operation may be simulated by performing a sequence of allowed operations. This paper investigates the problem of deciding whether a policy is consistent, and if not, how its inconsistencies can be repaired. We consider policies expressed in terms of annotated DTDs defining which operations are allowed or denied for the XML trees that are instances of the DTD. We show that consistency is decidable in PTIME for such policies and that consistent partial policies can be extended to unique "least-privilege" consistent total policies. We also consider repair problems based on deleting privileges to restore consistency, show that finding minimal repairs is NP-complete, and give heuristics for finding repairs.
Bravo Loreto
Cheney James
Fundulaki Irini
No associations
LandOfFree
Repairing Inconsistent XML Write-Access Control Policies does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Repairing Inconsistent XML Write-Access Control Policies, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Repairing Inconsistent XML Write-Access Control Policies will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-381119