A Review on Secure Multi-Keyword Ranked Search for Multi Data Owners in Cloud Computing
Keywords:
Multi-Keyword hunt, Coordinate Matching, Keywords, Index Generation, TrapdoorAbstract
In cloud computing, data owners outsource their complex data management systems from local sites to the public cloud for great flexibility and cost-effective. But before outsourcing, sensitive data have to be encrypted for protecting data privacy. This obsoletes traditional data utilization based on plaintext keyword search. Thus, allowing an encrypted cloud data search service is of vital importance. As there are large number of data users and documents in the cloud, it is necessary to allow multiple keywords in the search request and return documents in the order of their relevance to these keywords. In literature of searchable encryption single keyword search or Boolean keyword search techniques are discussed. In this paper, we propose the problem of privacy-preserving multi-keyword ranked search over encrypted data in cloud computing (MRSE). In which the queries are transferred to the server. Server searches the relevant content by using the coordinate matching and sends the results to the user. Then the user decrypts the data.
References
- L. M. Vaquero, L. Rodero-Merino, J. Caceres, and M. Lindner, "A break in the clouds: towards a cloud definition," ACM SIGCOMM Comput. Commun. Rev., vol. 39, no. 1, pp. 50–55, 2009.
- I. H. Witten, A. Moffat, and T. C. Bell, "Managing gigabytes: Compressing and indexing documents and images," Morgan Kaufmann Publishing, San Francisco, May 1999.
- D. Song, D. Wagner, and A. Perrig, "Practical techniques for huntes on encodeed data," in Proc. of S&P, 2000.
- E.-J. Goh, "Secure indexes," Cryptology ePrint Archive, 2003, http://eprint.iacr.org/2003/216.
- Y.-C. Chang and M. Mitzenmacher, "Privacy preserving keyword huntes on remote encodeed data," in Proc. of ACNS, 2005.
- R. Curtmola, J. A. Garay, S. Kamara, and R. Ostrovsky, "Huntable symmetric encodeion: improved definitions and efficient constructions," in Proc. of ACM CCS, 2006.
- D. Boneh, G. D. Crescenzo, R. Ostrovsky, and G. Persiano, "Public key encodeion with keyword hunt," in Proc. of EUROCRYPT, 2004.
- M. Bellare, A. Boldyreva, and A. ONeill, "Deterministic and efficiently huntableencodeion," in Proc. of CRYPTO, 2007.
- M. Abdalla, M. Bellare, D. Catalano, E. Kiltz, T. Kohno, T. Lange,J. Malone-Lee, G. Neven, P. Paillier, and H. Shi, "Huntableencodeion revisited: Consistency properties, relation to anonymous ibe, and extensions," J. Cryptol., vol. 21, no. 3, pp. 350–391, 2008.
- J. Li, Q. Wang, C. Wang, N. Cao, K. Ren, and W. Lou, "Fuzzy keyword hunt over encodeed data in cloud computing," in Proc. of IEEE INFOCOM’10 Mini-Conference, San Diego, CA, USA, March 2010.
- D. Boneh, E. Kushilevitz, R. Ostrovsky, and W. E. S. III, "Public key encodeion that allows pir queries," in Proc. of CRYPTO, 2007.
- P. Golle, J. Staddon, and B. Waters, "Secure conjunctive keyword hunt over encodeed data," in Proc. of ACNS, 2004, pp. 31–45.
- L. Ballard, S. Kamara, and F. Monrose, "Achieving efficient conjunctive keyword huntes over encodeed data," in Proc. of ICICS, 2005.
- D. Boneh and B. Waters, "Conjunctive, subset, and range queries on encodeed data," in Proc. of TCC, 2007, pp. 535– 554.
- R. Brinkman, "Hunting in encodeed data," in University of Twente, PhD thesis, 2007.
- Y. Hwang and P. Lee, "Public key encodeion with conjunctive keyword hunt and its extension to a multi-user system," in Pairing, 2007.
- J. Katz, A. Sahai, and B. Waters, "Predicate encodeion supporting disjunctions, polynomial equations, and inner products," in Proc. Of EUROCRYPT, 2008.
- C. Wang, N. Cao, J. Li, K. Ren, and W. Lou, "Secure ranked keyword hunt over encodeed cloud data," in Proc. of ICDCS’10, 2010.
Downloads
Published
Issue
Section
License
Copyright (c) IJSRCSEIT
This work is licensed under a Creative Commons Attribution 4.0 International License.