Privacy-Aware Multi-Keyword Top-k Search over Untrust Data Cloud

In this paper, we focus on data privacy of searchable symmetric encryption (SSE) in cloud computing. For the first time, we formulate the privacy issue from the aspect of similarity relevance and scheme robustness and then prove server-side ranking based on order-preserving encryption (OPE) inevitably leaks data privacy. In order to solve this problem, we propose a two round searchable encryption (TRSE) scheme, supporting top-k multi-keyword search, in which novel technologies, i.e., homomorphic encryption and vector space model, are employed. Vector space model helps to provide sufficient search accuracy, and homomorphic encryption enables users involve in the ranking while majority of computing work is still done on server-side by operations only on ciphertext. In this way, information leakage can be eliminated and data security is ensured. Thorough security analysis and performance analysis show that the proposed scheme guarantees high security and practical efficiency.

[1]  Nick Howgrave-Graham,et al.  Approximate Integer Common Divisors , 2001, CaLC.

[2]  David Dubin,et al.  The Most Influential Paper Gerard Salton Never Wrote , 2004, Libr. Trends.

[3]  Rafail Ostrovsky,et al.  Searchable symmetric encryption: improved definitions and efficient constructions , 2006, CCS '06.

[4]  Jianliang Xu,et al.  Processing private queries over untrusted data cloud through privacy homomorphism , 2011, 2011 IEEE 27th International Conference on Data Engineering.

[5]  Guan-Ming Su,et al.  Confidentiality-preserving rank-ordered search , 2007, StorageSS '07.

[6]  Dawn Xiaodong Song,et al.  Practical techniques for searches on encrypted data , 2000, Proceeding 2000 IEEE Symposium on Security and Privacy. S&P 2000.

[7]  Cong Wang,et al.  Privacy-Preserving Multi-Keyword Ranked Search over Encrypted Cloud Data , 2014 .

[8]  Cong Wang,et al.  Secure Ranked Keyword Search over Encrypted Cloud Data , 2010, 2010 IEEE 30th International Conference on Distributed Computing Systems.

[9]  Brent Waters,et al.  Conjunctive, Subset, and Range Queries on Encrypted Data , 2007, TCC.

[10]  Lucas Ballard,et al.  Achieving Efficient Conjunctive Keyword Searches over Encrypted Data , 2005, ICICS.

[11]  Wolfgang Nejdl,et al.  Zerber+R: top-k retrieval from a confidential index , 2009, EDBT '09.

[12]  Annie A. M. Cuyt,et al.  Handbook of Continued Fractions for Special Functions , 2008 .

[13]  Craig Gentry,et al.  Fully Homomorphic Encryption over the Integers , 2010, EUROCRYPT.

[14]  Rafail Ostrovsky,et al.  Public Key Encryption with Keyword Search , 2004, EUROCRYPT.

[15]  M. Chuah,et al.  Privacy-Aware BedTree Based Solution for Fuzzy Multi-keyword Search over Encrypted Data , 2011, 2011 31st International Conference on Distributed Computing Systems Workshops.

[16]  Ronald L. Rivest,et al.  Introduction to Algorithms , 1990 .

[17]  Craig Gentry,et al.  Fully homomorphic encryption using ideal lattices , 2009, STOC '09.

[18]  Brent Waters,et al.  Secure Conjunctive Keyword Search over Encrypted Data , 2004, ACNS.