skip to main content
10.1145/1007568.1007634acmconferencesArticle/Chapter ViewAbstractPublication PagesmodConference Proceedingsconference-collections
Article

Secure XML querying with security views

Published:13 June 2004Publication History

ABSTRACT

The prevalent use of XML highlights the need for a generic, flexible access-control mechanism for XML documents that supports efficient and secure query access, without revealing sensitive information unauthorized users. This paper introduces a novel paradigm for specifying XML security constraints and investigates the enforcement of such constraints during XML query evaluation. Our approach is based on the novel concept of security views, which provide for each user group (a) an XML view consisting of all and only the information that the users are authorized to access, and (b) a view DTD that the XML view conforms to. Security views effectively protect sensitive data from access and potential inferences by unauthorized user, and provide authorized users with necessary schema information to facilitate effective query formulation and optimization. We propose an efficient algorithm for deriving security view definitions from security policies (defined on the original document DTD) for different user groups. We also develop novel algorithms for XPath query rewriting and optimization such that queries over security views can be efficiently answered without materializing the views. Our algorithms transform a query over a security view to an equivalent query over the original document, and effectively prune query nodes by exploiting the structural properties of the document DTD in conjunction with approximate XPath containment tests. Our work is the first to study a flexible, DTD-based access-control model for XML and its implications on the XML query-execution engine. Furthermore, it is among the first efforts for query rewriting and optimization in the presence of general DTDs for a rich a class of XPath queries. An empirical study based on real-life DTDs verifies the effectiveness of our approach.

References

  1. S. Abiteboul, P. Buneman, and D. Suciu. Data on Web. From Relations to Semistructured Data and XML. Morgan Kaufman. 2000.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. S. Amer-Yahia, S. Cho, L. V. S. Lakshmanan, and D. Srivastava. Minimization of tree pattern queries. In SIGMOD, 2001.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. E. Bertino and E. Ferrari. Secure and selective dissemination of XML documents. TISSEC, 5(3):290--331, 2002.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. T. Bray, J. Paoli, and C. M. Sperberg-McQueen. Extensible Markup Language (XML) 1.0 W3C Recommendation, Feb. 1998.]]Google ScholarGoogle Scholar
  5. S. Castano, M. G. Fugini, G. Martella, and P. Samarati. "Database Security". Addison-Wesley. 1995.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. S. Cho, S. Amer-Yahia, L. Lakshmanan, and D. Srivastava. Optimizing the secure evaluation of twig queries. In VLDB, 2002.]]Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. J. Clark and S. DeRose. XML Path Languages (XPath). W3C Working Draft, Nov. 1999.]]Google ScholarGoogle Scholar
  8. E. Damiani, S. di Vimercati, S. Paraboschi, and P. Samarati. Securing XML documents. In EDBT, 2000.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. E. Damiani S. di Vemercati, S. Paraboschi, and P. Samarati. A fine-grained access control system for XML documents TISSEC, 5(2):169--202, 2002.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. A. Deutsch. L. Popa, and V. Tannen. Physical data independence, constraints, and optimization with universal plans. In VLDB, 1999.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. A. Deutsch and V. Tannen. Reformulation of XML queries and constraints. in ICDT, 2003]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. A. Diaz and D. Lovell, XML generator, 1999.]]Google ScholarGoogle Scholar
  13. M. F. Fernandez, Y. Kadiyska, D. S. A. Morishima, and W. Tan. SilkRoute: A framework for publishing relational data in XML. TODS, 27(4):438--493, 2002.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. M. F. Fernandez and D. Suciu. Optimizing regular path expressions using graph schemas. In ICDE, 1998.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. G, Gottlob, C. Koch, and R, Pichler, Efficient algorithms for processing XPath queries. In VLDB, 2002.]]Google ScholarGoogle Scholar
  16. S. Hada and M. Kudo. XML access control language: Provisional authorization for XML documents. http://www.trl.ibm.com/projects/xml/xacl/xacl-spec.html.]]Google ScholarGoogle Scholar
  17. C. Koch. XML Task Force, 2003.]]Google ScholarGoogle Scholar
  18. G. Miklau and D. Suciu. Containment and equivalence of XPath expressions. In PODS, 2002.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. G. Miklau and D. Suciu. controlling access to published data using cryptography. In VLDB, 2003.]]Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. R. Milner. "Communication and Concurrency". Prentice Hall (Intl. Series in Computer Science), 1989.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. T. Milo and D. Suciu. Index structures for path expressions. In ICDT, 1999.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. M. Murata, A. Tozawa, M. Kudo, and S. Hada. XML access control using static analysis. In CCS, 2003.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  23. NAA Classified advertising standard task force. Adex DTD, 1999.]]Google ScholarGoogle Scholar
  24. F. Neven and T. Schwentick. XPath containment in the presence of disjunction, DTDs, and variables, In ICDT, 2003.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  25. Oasis. eXtensible Access Control Markup Language (XACML). http://www.oasis-open.org/committees/xcaml.]]Google ScholarGoogle Scholar
  26. Y. Papakonstantinou and V. Vassalos. Query rewriting for semistructured data. In SIGMOD, 1999.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  27. P. Ramanan. Efficient algorithms for minimizing tree pattern queries. In SIGMOD, 2002.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  28. T., Asano, K. Hori, T. Ono, and T. Hirata, A theoretical framework of hybrid approaches to MAX SAT. In Proc. 8th Ann. Int. Symp. on Algorithms and Computation., 1997.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  1. Secure XML querying with security views

          Recommendations

          Comments

          Login options

          Check if you have access through your login credentials or your institution to get full access on this article.

          Sign in
          • Published in

            cover image ACM Conferences
            SIGMOD '04: Proceedings of the 2004 ACM SIGMOD international conference on Management of data
            June 2004
            988 pages
            ISBN:1581138598
            DOI:10.1145/1007568

            Copyright © 2004 ACM

            Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

            Publisher

            Association for Computing Machinery

            New York, NY, United States

            Publication History

            • Published: 13 June 2004

            Permissions

            Request permissions about this article.

            Request Permissions

            Check for updates

            Qualifiers

            • Article

            Acceptance Rates

            Overall Acceptance Rate785of4,003submissions,20%

          PDF Format

          View or Download as a PDF file.

          PDF

          eReader

          View online with eReader.

          eReader