Enhanced Robustic Platform for Secure Multi-Keyword Ranked Search in Cloud Computing

International Journal of Computer Trends and Technology (IJCTT)          
© 2015 by IJCTT Journal
Volume-25 Number-1
Year of Publication : 2015
Authors : E.Lavanya, M.Chandra Mouli Reddy


E.Lavanya, M.Chandra Mouli Reddy "Enhanced Robustic Platform for Secure Multi-Keyword Ranked Search in Cloud Computing". International Journal of Computer Trends and Technology (IJCTT) V25(1):45-49, July 2015. ISSN:2231-2803. www.ijcttjournal.org. Published by Seventh Sense Research Group.

Abstract -
As distributed computing turn out to be more adaptable & viable regarding economy, information proprietors are inspired to outsource their unpredictable information frameworks from nearby destinations to business open cloud. However, for security of information, touchy information must be scrambled before outsourcing, which succeeds strategy for conventional information use in view of plaintext catchphrase seek. Considering the huge number of information clients also, archives in cloud, it is fundamental for the pursuit administration to permit multicatchphrase inquiry and give result comparability positioning to meet the compelling information recovery need. Recovering of all the records having questioned decisive word won't be reasonable in pay according to utilize cloud ideal model. In this paper, we propose the issue of Secured Multi-decisive word look (SMS) over encoded cloud information (ECD), and develop a gathering of security strategies for such a protected cloud information usage framework. From number of multidecisive word semantics, we select the exceptionally proficient tenet of direction coordinating, i.e., whatever number matches as could be allowed, to recognize the similitude between pursuit inquiry and information , and for further coordinating we utilize inward information correspondence to quantitatively formalize such rule for likeness estimation. We first propose a fundamental Secured multi magic word positioned pursuit plan utilizing secure inward item calculation, and afterward enhance it to meet diverse protection necessities. The Ranked result gives top k recovery results. Likewise we propose a caution framework which will produce cautions when un-approved client tries to get to the information from cloud, the ready will produce in the type of mail and message.

[1] N. Cao, C. Wang, M. Li, K. Ren, and W. Lou, “Privacy- PreservingMulti-Keyword Ranked Search over Encrypted Cloud Data,”Proc.IEEEINFOCOM,pp. 829-837, Apr, 2011.
[2] L.M. Vaquero, L. Rodero-Merino, J. Caceres, and M. Lindner, “ABreak in the Clouds: Towards a Cloud Definition,” ACMSIGCOMM Comput. Commun. Rev.,vol. 39, no. 1, pp. 50- 55, 2009.
[3] N. Cao, S. Yu, Z. Yang, W. Lou, and Y. Hou, “LT Codes- BasedSecure and Reliable Cloud Storage Service,”Proc. IEEE INFO-COM,pp. 693-701, 2012.
[4] S. Kamara and K. Lauter, “Cryptographic Cloud Storage,”Proc.14th Int’l Conf. Financial Cryptograpy and Data Security,Jan. 2010.
[5] A. Singhal, “Modern Information Retrieval: A Brief Overview,”IEEE Data Eng. Bull.,vol. 24, no. 4, pp. 35-43, Mar. 2001.
[6] I.H. Witten, A. Moffat, and T.C. Bell, Managing Gigabytes:Compressing and Indexing Documents and Images.MorganKaufmannPublishing, May 1999.
[7] D. Song, D. Wagner, and A. Perrig, “Practical Techniques forSearches on Encrypted Data,” Proc. IEEE Symp. Security and Privacy,2000.
[8] E.-J. Goh, “Secure Indexes,”CryptologyePrint Archive, http:// eprint.iacr.org/ 2003/216. 2003.
[9] 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.
[10] R. Curtmola, J.A. Garay, S. Kamara, and R. Ostrovsky, “Searchable Symmetric Encryption: Improved Definitions and Efficient Con-structions,” Proc. 13th ACM Conf. Computer and Comm. Security (CCS ’06),2006.
[11] 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.
[12] 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.
[13] M. Abdalla, M. Bellare, D. Catalano, E. Kiltz, T. Kohno, T. Lange, J. Malone-Lee, G. Neven, P. Paillier, and H. Shi, “Searchable Encryption Revisited: Consistency Properties, Relation to Anon-ymousIbe, and Extensions,”J. Cryptology, vol. 21, no. 3, pp. 350-391, 2008.

Encryption, Inner product similarity, Multi-keyword search, ranking.