ABSTRACT
This paper introduces a new framework for confidentiality preserving rank-ordered search and retrieval over large document collections. The proposed framework not only protects document/query confidentiality against an outside intruder, but also prevents an untrusted data center from learning information about the query and the document collection. We present practical techniques for proper integration of relevance scoring methods and cryptographic techniques, such as order preserving encryption, to protect data collections and indices and provide efficient and accurate search capabilities to securely rank-order documents in response to a query. Experimental results on the W3C collection show that these techniques have comparable performance to conventional search systems designed for non-encrypted data in terms of search accuracy. The proposed methods thus form the first steps to bring together advanced information retrieval and secure search capabilities for a wide range of applications including managing data in government and business operations, enabling scholarly study of sensitive data, and facilitating the document discovery process in litigation.
- I.H. Witten, A. Moffett, and T.C. Bell. Managing Gigabytes, Morgan Kaufmann, 2nd ed., 1999.Google Scholar
- R. Curtmola, J. Garay, S. Kamara, and R. Ostrovsky, ``Searchable Symmetric Encryption: Improved Definitions and Efficient Constructions,'' Proc. of the ACM Comp. and Comm. Security (CCS), Oct. 2006. Google ScholarDigital Library
- S. E. Robertson and K. S. Jones, ``Simple Proven Approaches to Text Retrieval,'' Technical Report TR356, Cambridge Univ. Computer Laboratory, 1997.Google Scholar
- R. Brinkman, J. M. Doumen, and W. Jonker, ``Using Secret Sharing for Searching in Encrypted Data,'' Workshop on Secure Data Management in a Connected World, LNCS 3178, pp. 18--27, Aug. 2004.Google Scholar
- B. Chor, O. Goldreich, E. Kushilevitz, and M. Sudan, ``Private Information Retrieval,'' J. ACM, vol. 45, no. 6, pp. 965--982, 1998. Google ScholarDigital Library
- D. Song, D. Wagner, and A. Perrig, ``Practical Techniques for Searches on Encrypted Data,'' IEEE Sym. on Research in Security and Privacy, pp. 44--55, May 2000. Google ScholarDigital Library
- D. Boneh, G. Crescenzo, R. Ostrovsky, G. Persiano, ``Public--key Encryption with Keyword Search,'' Proceedings of Eurocrypt, 2004.Google Scholar
- E-J. Goh, ``Secure Indexes,'' Cryptology ePrint Archive, Report 2003/216, 2003.Google Scholar
- B. Klimt and Y. Yang, ``Introducing the Enron Corpus,'' Conf. on Email and Anti-Spam (CEAS), Mountain View, CA, 2004.Google Scholar
- R. Agrawal, J. Kiernan, R. Srikant, and Y. Xu, ``Order Preserving Encryption for Numeric Data,'' Proc. of SIGMOD, Jun. 2004. Google ScholarDigital Library
- D. K. Harman, ``Common Evaluation Measures,'' in Appendix, Proceedings of Text Retrieval Conference, 2005. Available online at http://trec.nist.gov/Google Scholar
- N. Craswell, A. P. de Vries, and I. Soboroff, ``Overview of the TREC--2005 Enterprise Track,'' Text Retrieval Conference, 2005.Google Scholar
Index Terms
- Confidentiality-preserving rank-ordered search
Recommendations
Searchable Encryption with Secure and Efficient Updates
CCS '14: Proceedings of the 2014 ACM SIGSAC Conference on Computer and Communications SecuritySearchable (symmetric) encryption allows encryption while still enabling search for keywords. Its immediate application is cloud storage where a client outsources its files while the (cloud) service provider should search and selectively retrieve those. ...
Efficient top representative for multi-authorship encrypted cloud data to assist cognitive search
Special section: Recent trends, Challenges and Applications in Cognitive Computing for Intelligent SystemsCloud computing is gaining ground in the digital and business world. It delivers storage service for user access using Internet as a medium. Besides the numerous benefits of cloud services, migrating to public cloud storage leads to security and privacy ...
Semantic Similarity Search on Semistructured Data with the XXL Search Engine
AbstractQuery languages for XML such as XPath or XQuery support Boolean retrieval: a query result is a (possibly restructured) subset of XML elements or entire documents that satisfy the search conditions of the query. This search paradigm works for ...
Comments