Confidentiality-preserving rank-ordered search

Authors:
Ashwin Swaminathan;Yinian Mao;Guan-Ming Su;Hongmei Gou;Avinash L. Varna;Shan He;Min Wu;Douglas W. Oard
Affiliations:
University of Maryland, College Park, MD;University of Maryland, College Park, MD;University of Maryland, College Park, MD;University of Maryland, College Park, MD;University of Maryland, College Park, MD;University of Maryland, College Park, MD;University of Maryland, College Park, MD;University of Maryland, College Park, MD
Venue:
Proceedings of the 2007 ACM workshop on Storage security and survivability
Year:
2007

Citing 4
Cited 3

Private information retrieval

Journal of the ACM (JACM)
Practical Techniques for Searches on Encrypted Data

SP '00 Proceedings of the 2000 IEEE Symposium on Security and Privacy
Order preserving encryption for numeric data

SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Searchable symmetric encryption: improved definitions and efficient constructions

Proceedings of the 13th ACM conference on Computer and communications security

Zerber+R: top-k retrieval from a confidential index

Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
Additive order preserving encryption based encrypted documents ranking in secure cloud storage

ICSI'12 Proceedings of the Third international conference on Advances in Swarm Intelligence - Volume Part II
Privacy-preserving multi-keyword text search in the cloud supporting similarity-based ranking

Proceedings of the 8th ACM SIGSAC symposium on Information, computer and communications security

Quantified Score

Hi-index	0.00

Visualization

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.