Author : ]Nita Elizabeth Samuel 1
Date of Publication :7th April 2015
Abstract: With the advancement in technology, users have the flexibility for outsourcing data from local sites to commercial public clouds. As data is being outsourced to clouds, there is the need for ensuring the security of the data which is being stored in the cloud. We have been using various security measures in the cloud infrastructure for this purpose and that includes encryption of the cloud data and accessing them using a Boolean keyword search or a single keyword. But these two methods have its own drawbacks. As the number of cloud service users increases these two methods of accessing the data will become less secure. So we are introducing the new idea of multi keyword ranked search on encrypted cloud data. In this we implement a set of strict privacy policies for secure cloud data utilization. Coordinate matching which is an efficient method for finding the most relevant data with the help of queries is used here. Similarities between data and the multi keyword being used are found out by using inner productsimilarity.
Reference :
-
- S. Kamara and K. Lauter, “Cryptographic Cloud Storage,” Proc. 14th Int‟l Conf. Financial Cryptography and Data Security, Jan. 2010
- D. Song, D. Wagner, and A. Perrig, “Practical Techniques for Searches on Encrypted Data,” Proc. IEEE Symp. Security and Privacy, 2000
- E.-J. Goh, “Secure Indexes,” Cryptology ePrint Archive, http://eprint.iacr.org/2003/216. 2003
- Y.-C. Chang and M. Mitzenmacher, “Privacy Preserving Keyword Searches on Remote Encrypted Data,” Proc. Third Int‟l Conf. Applied Cryptography and Network Security, 2005
- R. Curtmola, J.A. Garay, S. Kamara, and R. Ostrovsky, “Searchable Symmetric Encryption Improved Definitions and Efficient Constructions,” Proc. 13th ACM Conf. Computer and Comm. Security (CCS ‟06), 2006.
- D. Boneh, G.D. Crescenzo, R. Ostrovsky, and G. Persiano, “Public Key Encryption with Keyword Search,” Proc. Int‟l Conf. Theory and Applications of Cryptographic Techniques (EUROCRYPT), 2004.
- M. Bellare, A. Boldyreva, and A. ONeill, “Deterministic and Efficiently Searchable Encryption,” Proc. 27th Ann. Int‟l Cryptology Conf. Advances in Cryptology (CRYPTO ‟07), 2007.
- 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, Mar. 2010
- P. Golle, J. Staddon, and B. Waters, “Secure Conjunctive Keyword Search over Encrypted Data,” Proc. Applied Cryptography and Network Security,pp 31- 45,2004.
- J. Katz, A. Sahai and B. Waters, “Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products,” Proc. 27th Ann. Int‟l Conf. Theory and Applications of Cryptographic Techniques (EUROCRYPT), 2008
- E. Shen, E. Shi, and B. Waters, “Predicate Privacy in Encryption Systems,” Proc. Sixth Theory of Cryptography Conf. Theory of Cryptography (TCC), 2009.
- 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.
- S. Zerr, D. Olmedilla, W. Nejdl, and W. Siberski, “Zerber+r: Top-k Retrieval from a Confidential Index,” Proc. 12th Int‟l Conf. Extending Database Technology (EDBT ‟09), pp. 439-449, 2009 .
- A. Singhal, “Modern Information Retrieval: A Brief Overview,” IEEE Data Eng. Bull., vol. 24, no. 4, pp. 35-43, Mar. 2001.
- I.H. Witten, A. Moffat, and T.C. Bell, Managing Gigabytes: Compressing and Indexing Documents and Images. Morgan Kaufmann Publishing, May 1999
- N. Cao, C. Wang, M. Li, K. Ren, and W. Lou, “Privacy-Preserving Multi-Keyword Ranked Search over Encrypted Cloud Data,” Proc.IEEE INFOCOM, pp. 829- 837, Apr, 2011.