This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Enabling Secure and Efficient Ranked Keyword Search over Outsourced Cloud Data
Aug. 2012 (vol. 23 no. 8)
pp. 1467-1479
ASCII Text
x 
 
Cong Wang, Ning Cao, Kui Ren, Wenjing Lou, "Enabling Secure and Efficient Ranked Keyword Search over Outsourced Cloud Data," IEEE Transactions on Parallel and Distributed Systems, vol. 23, no. 8, pp. 1467-1479, Aug., 2012.
 
 
BibTex
x
 
@article{ 10.1109/TPDS.2011.282,
author = {Cong Wang and Ning Cao and Kui Ren and Wenjing Lou},
title = {Enabling Secure and Efficient Ranked Keyword Search over Outsourced Cloud Data},
journal ={IEEE Transactions on Parallel and Distributed Systems},
volume = {23},
number = {8},
issn = {1045-9219},
year = {2012},
pages = {1467-1479},
doi = {http://doi.ieeecomputersociety.org/10.1109/TPDS.2011.282},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - JOUR
JO - IEEE Transactions on Parallel and Distributed Systems
TI - Enabling Secure and Efficient Ranked Keyword Search over Outsourced Cloud Data
IS - 8
SN - 1045-9219
SP1467
EP1479
EPD - 1467-1479
A1 - Cong Wang,
A1 - Ning Cao,
A1 - Kui Ren,
A1 - Wenjing Lou,
PY - 2012
KW - Ranked search
KW - searchable encryption
KW - order-preserving mapping
KW - confidential data
KW - cloud computing.
VL - 23
JA - IEEE Transactions on Parallel and Distributed Systems
ER -
 
Cong Wang, Illinois Institute of Technology, Chicago
Ning Cao, Worcester Polytechnic Institute, Worcester
Kui Ren, Illinois Institute of Technology, Chicago
Wenjing Lou, Virginia Polytechnic Institute and State University, Falls Church
Cloud computing economically enables the paradigm of data service outsourcing. However, to protect data privacy, sensitive cloud data have to be encrypted before outsourced to the commercial public cloud, which makes effective data utilization service a very challenging task. Although traditional searchable encryption techniques allow users to securely search over encrypted data through keywords, they support only Boolean search and are not yet sufficient to meet the effective data utilization need that is inherently demanded by large number of users and huge amount of data files in cloud. In this paper, we define and solve the problem of secure ranked keyword search over encrypted cloud data. Ranked search greatly enhances system usability by enabling search result relevance ranking instead of sending undifferentiated results, and further ensures the file retrieval accuracy. Specifically, we explore the statistical measure approach, i.e., relevance score, from information retrieval to build a secure searchable index, and develop a one-to-many order-preserving mapping technique to properly protect those sensitive score information. The resulting design is able to facilitate efficient server-side ranking without losing keyword privacy. Thorough analysis shows that our proposed solution enjoys “as-strong-as-possible” security guarantee compared to previous searchable encryption schemes, while correctly realizing the goal of ranked keyword search. Extensive experimental results demonstrate the efficiency of the proposed solution.

[1] C. Wang, N. Cao, J. Li, K. Ren, and W. Lou, "Secure Ranked Keyword Search over Encrypted Cloud Data," Proc. IEEE 30th Int'l Conf. Distributed Computing Systems (ICDCS '10), 2010.
[2] P. Mell and T. Grance, "Draft Nist Working Definition of Cloud Computing," http://csrc.nist.gov/groups/SNS/cloud- computing index.html, Jan. 2010.
[3] M. Armbrust, A. Fox, R. Griffith, A.D. Joseph, R.H. Katz, A. Konwinski, G. Lee, D.A. Patterson, A. Rabkin, I. Stoica, and M. Zaharia, "Above the Clouds: A Berkeley View of Cloud Computing," Technical Report UCB-EECS-2009-28, Univ. of California, Berkeley, Feb. 2009.
[4] Cloud Security Alliance "Security Guidance for Critical Areas of Focus in Cloud Computing," http:/www.cloudsecurityalliance. org, 2009.
[5] Z. Slocum, "Your Google Docs: Soon in Search Results?" http://news.cnet.com8301-17939_109-10357137-2.html , 2009.
[6] B. Krebs, "Payment Processor Breach May Be Largest Ever," http://voices.washingtonpost.com/securityfix/ 2009/01 payment_processor_breach_may_b.html , Jan. 2009.
[7] I.H. Witten, A. Moffat, and T.C. Bell, Managing Gigabytes: Compressing and Indexing Documents and Images. Morgan Kaufmann, May 1999.
[8] D. Song, D. Wagner, and A. Perrig, "Practical Techniques for Searches on Encrypted Data," Proc. IEEE Symp. Security and Privacy, 2000.
[9] E.-J. Goh, "Secure Indexes," Technical Report 2003/216, Cryptology ePrint Archive, http:/eprint.iacr.org/, 2003.
[10] D. Boneh, G.D. Crescenzo, R. Ostrovsky, and G. Persiano, "Public Key Encryption with Keyword Search," Proc. Int'l Conf. Advances in Cryptology (EUROCRYP '04), 2004.
[11] Y.-C. Chang and M. Mitzenmacher, "Privacy Preserving Keyword Searches on Remote Encrypted Data," Proc. Int'l Conf. Applied Cryptography and Network Security (ACNS '05), 2005.
[12] R. Curtmola, J.A. Garay, S. Kamara, and R. Ostrovsky, "Searchable Symmetric Encryption: Improved Definitions and Efficient Constructions," Proc. ACM Conf. Computer and Comm. Security (CCS '06), 2006.
[13] A. Singhal, "Modern Information Retrieval: A Brief Overview," IEEE Data Eng. Bull., vol. 24, no. 4, pp. 35-43, 2001.
[14] A. Boldyreva, N. Chenette, Y. Lee, and A. O'Neill, "Order-Preserving Symmetric Encryption," Proc. Int'l Conf. Advances in Cryptology (Eurocrypt '09), 2009.
[15] J. Zobel and A. Moffat, "Exploring the Similarity Space," SIGIR Forum, vol. 32, no. 1, pp. 18-34, 1998.
[16] O. Goldreich and R. Ostrovsky, "Software Protection and Simulation on Oblivious Rams," J. ACM, vol. 43, no. 3, pp. 431-473, 1996.
[17] M. Bellare, A. Boldyreva, and A. O'Neill, "Deterministic and Efficiently Searchable Encryption," Proc. Ann. Int'l Cryptology Conf. Advances in Cryptology (Crypto '07), 2007.
[18] S. Zerr, D. Olmedilla, W. Nejdl, and W. Siberski, "Zerber+r: Top-k Retrieval from a Confidential Index," Proc. Int'l Conf. Extending Database Technology: Advances in Database Technology (EDBT '09), 2009.
[19] Q. Wang, C. Wang, K. Ren, W. Lou, and J. Li, "Enabling Public Verifiability and Data Dynamics for Storage Security in Cloud Computing," IEEE Trans. Parallel and Distributed Systems, vol. 22, no. 5, pp. 847-859, May 2011.
[20] C. Wang, Q. Wang, K. Ren, and W. Lou, "Towards Secure and Dependable Storage Services in Cloud Computing," IEEE Trans. Service Computing, to appear.
[21] C. Wang, S. Chow, Q. Wang, K. Ren, and W. Lou, "Privacy-Preserving Public Auditing for Secure Cloud Storage," IEEE Trans. Computers, to appear.
[22] A. Swaminathan, Y. Mao, G.-M. Su, H. Gou, A.L. Varna, S. He, M. Wu, and D.W. Oard, "Confidentiality-Preserving Rank-Ordered Search," Proc. Workshop Storage Security and Survivability, 2007.
[23] RFC "Request for Comments Database," http://www.ietf.orgrfc.html, 2012.
[24] B. Waters, D. Balfanz, G. Durfee, and D. Smetters, "Building an Encrypted and Searchable Audit Log," Proc. Ann. Network and Distributed Security Symp. (NDSS '04), 2004.
[25] F. Bao, R. Deng, X. Ding, and Y. Yang, "Private Query on Encrypted Data in Multi-User Settings," Proc. Int'l Conf. Information Security Practice and Experience (ISPEC '08), 2008.
[26] P. Golle, J. Staddon, and B.R. Waters, "Secure Conjunctive Keyword Search over Encrypted Data," Proc. Second Int'l Conf. Applied Cryptography and Network Security (ANCS '04), pp. 31-45, 2004.
[27] L. Ballard, S. Kamara, and F. Monrose, "Achieving Efficient Conjunctive Keyword Searches over Encrypted Data," Proc. Int'l Conf. Information and Comm. Security (ICICS '05), 2005.
[28] Y.H. Hwang and P.J. Lee, "Public Key Encryption with Conjunctive Keyword Search and Its Extension to a Multi-User System," Proc. Int'l Conf. Pairing-Based Cryptography (Pairing '07), pp. 31-45, 2007.
[29] J. Li, Q. Wang, C. Wang, N. Cao, K. Ren, and W. Lou, "Fuzzy Keyword Search over Encrypted Data in Cloud Computing," Proc. IEEE INFOCOM '10, 2010.
[30] N. Cao, C. Wang, M. Li, K. Ren, and W. Lou, "Privacy-Preserving Multi-Keyword Ranked Search over Encrypted Cloud Data," Proc. IEEE INFOCOM '11, 2011.
[31] D. Boneh and B. Waters, "Conjunctive, Subset, and Range Queries on Encrypted Data," Proc. Fourth Conf. Theory of Cryptography (TCC '07), pp. 535-554, 2007.
[32] E. Shi, J. Bethencourt, H. Chan, D. Song, and A. Perrig, "Multi-Dimensional Range Query over Encrypted Data," Proc. IEEE Symp. Security and Privacy, 2007.
[33] K. Ren, C. Wang, and Q. Wang, "Security Challenges for the Public Cloud," IEEE Internet Computing, vol. 16, no. 1, pp. 69-73, 2012.
[34] C. Wang, K. Ren, S. Yu, K. Mahendra, and R. Urs, "Achieving Usable and Privacy-Assured Similarity Search over Outsourced Cloud Data," Proc. IEEE INFOCOM, 2012.

Index Terms:
Ranked search, searchable encryption, order-preserving mapping, confidential data, cloud computing.
Citation:
Cong Wang, Ning Cao, Kui Ren, Wenjing Lou, "Enabling Secure and Efficient Ranked Keyword Search over Outsourced Cloud Data," IEEE Transactions on Parallel and Distributed Systems, vol. 23, no. 8, pp. 1467-1479, Aug. 2012, doi:10.1109/TPDS.2011.282
Usage of this product signifies your acceptance of the Terms of Use.