Efficient secure query evaluation over encrypted XML databases

VLDB 2006 - Proceedings of the 32nd International Conference on Very Large Data Bases

Volumn , Issue , 2006, Pages 127-138

  Wang, Hui ^a   Lakshmanan, Laks V S ^a  

^a UNIVERSITY OF BRITISH COLUMBIA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

CRYPTOGRAPHY; METADATA; PROBABILITY DISTRIBUTIONS; QUERY LANGUAGES; XML;

ATTACK MODELING; DATABASE AS SERVICES; ENCRYPTED DATABASE; PROBABILITY: DISTRIBUTIONS; PROPERTY; QUERY EVALUATION; SECURE QUERIES; SERVICE PARADIGM; THIRD PARTIES; XML-DATABASE;

QUERY PROCESSING;

EID: 84893821498     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (26)

1. M. Abadi et al., "Security Analysis of O'ryptographically Controlled Access to XML Documents,", PODS 2005.
2. G. Aggrawal et al., "Two can Keep a Secret: A distributed Architecture for Secure Database Services,", CIDR 2005.
3. Ft. Agrawal et al., "Order Preserving Encryption for Numeric Data,", SIGMOD 2001.
4. S. Al-Khalifa et al., "Structural Joins: A Primitive for Efficient XML Query Pattern Matching,", ICDE 2002.
5. M. Bellare, "Practice-oriented provable-security,", ISW 1997.
6. E. Bertino et al., "Secure and selective dissemination of XML documents,", ACM Transactions on Information and System Security, 5(3), Page 290-331, 2002.
7. H. Brinkman et al., "Efficient Tree Search in Encrypted Data,", 2nd International Workshop on Security in Information Systems, April 2004.
8. Y. Chang, "Single database private information retrieval with logarithmic communication,", oprint 2004/036.
9. Ii. Ohor et al., "Private information retrieval,", Proc. of 36th IEEE Symposium on Foundations of Computer Science, 1995.
10. K.L. Clarkson, "A modification of the greedy algorithm for vertex cover,", Information Processing Letters, 16 (1983), pp. 23-25.
11. S. Claude, "Communication theory of secrecy systems."
12. E. Damiani et al., "Balancing confidentiality and efficiency in untrusted relational DBMSs. Proc. of ACM Conference on Computer and Communications Security, 2003.
13. D. Denning, "Cryptography and Data Security,", Addison-Wesley, 1982.
14. B. Finance et al., "The Case for Access Control on XML Relationships,", CIKM, 2005.
15. S. Goldwasser et al., "Cryptography: Lecture Notes,", pp. 83, August 2001.
16. V. Gowadia et al., "RDF Metadata for XML Access Control,", ACM Workshop on Security, 2003.
17. H. Hacigumus et al., "Executing SQL over Encrypted Data in the Database-Service-Provided Model,". SIGMOD 2002.
18. B. Bore et al., "A Privacy-Preserving Index for Range Queries,". VLDB 2004.
19. M. Kantarcioglu et al., "Security Issues in Querying Encrypted Data,", Technical Report, Purdue U., 2004.
20. F. Kushilevitz et al., "Replication is not needed: Single Database, Computationally-Private Information Retrieval,", FOCS97.
21. P. Lin et al., "Secure and Privacy Preserving Outsourcing of Tree Structured Data,", SDM 2004.
22. U. Maheshwari et al., "Bow to Build a Trusted Database System on Untrusted Storage,", OSDI 2000.
23. J. Miklau et al. "Controlling Access to Published Data Using Cryptography,", VLDB 2003.
24. G. Miklau et al, "A Formal Analysis of Information Disclosure in Data Exchange,", SIGMOD 2001.
25. Motwani et al., "Lecture Notes on Approximation Algorithms,", 1992.
26. B. Wang et al., "Efficient Secure Query Evaluation over Encrypted XML Databases on Unstusted Server: Full Paper,", ftp://ftp.cs.ubc.ca/local/ laks/papers/xcryp-fullpaper.pdf.