Role-Based Access Control Models
Computer
XMill: an efficient compressor for XML data
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
XML document security based on provisional authorization
Proceedings of the 7th ACM conference on Computer and communications security
A fine-grained access control system for XML documents
ACM Transactions on Information and System Security (TISSEC)
Secure and selective dissemination of XML documents
ACM Transactions on Information and System Security (TISSEC)
DataGuides: Enabling Query Formulation and Optimization in Semistructured Databases
VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
XML access control using static analysis
Proceedings of the 10th ACM conference on Computer and communications security
Translating Content-Based Authorizations for XML Documents
WISE '03 Proceedings of the Fourth International Conference on Web Information Systems Engineering
Authorization Translation for XML Document Transformation
World Wide Web
A compressed accessibility map for XML
ACM Transactions on Database Systems (TODS)
QFilter: fine-grained run-time XML access control via NFA-based query rewriting
Proceedings of the thirteenth ACM international conference on Information and knowledge management
Vectorizing and Querying Large XML Repositories
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Compressed accessibility map: efficient access control for XML
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
| Hi-index | 0.00 |
As documents containing sensitive information are exchanged over the Internet, access control of XML documents is becoming important. Access control policies can specify fine-grained rules to documents, but policies sometimes become redundant, as documents are restructured or combined during exchange. In this paper, we consider a new approach of optimizing access control policies, by extracting distribution information of given authorization values within XML data. The extracted information is called a global policy tree, and it can be utilized for minimizing the total size of policies as well as efficient query processing. We present a linear-time algorithm for minimizing policies utilizing global policy trees, and our evaluation results show significant improvement over existing work.