A Novel Implementation of Fuzzy Keyword Search over Encrypted Data in Cloud Computing
| ||International Journal of Computer Trends and Technology (IJCTT)|| |
|© July to Aug Issue 2011 by IJCTT Journal|
|Volume-1 Issue-3 |
|Year of Publication : 2011|
|Authors : RANJEETH KUMAR.M , D.VASUMATHI.|
RANJEETH KUMAR.M , D.VASUMATHI. "A Novel Implementation of Fuzzy Keyword Search over Encrypted Data in Cloud Computing"International Journal of Computer Trends and Technology (IJCTT),V1(3):365-369 July to Aug Issue 2011 .ISSN 2231-2803.www.ijcttjournal.org. Published by Seventh Sense Research Group.
Abstract: —Cloud computing is an internet computing in which data is stored and accessed via a remote third party server called cloud, rather than being stored locally on our machine and the resources, software’s, and information are provided to users on demand. In cloud computing environment data security is an on-going challenging task, hence the sensitive data has to be encrypted before outsourcing. In existing technique we retrieve the files from the cloud, by searching the keywords on the encrypted data. They are many searching technique which were implemented in the cloud but the disadvantages with these technique supports only exact keyword search. Typical users searching behaviors are happen very frequently these are the drawbacks with the existing system which are not suitable for cloud computing environment and which effects system usability. Our proposed work in this paper concentrates on solving the problems of the user who search the data with the help of fuzzy keyword on cloud. We formalize and solve the problems of effective fuzzy keyword search over encrypted cloud data while maintaining keyword privacy. Using fuzzy search the exact keywords are displayed along with similarity keywords, which solve the problems faced by the cloud users. We show that our proposed solution is secure and privacy preserving, while correctly realizing the goal of fuzzy keyword search.
EUROCRYP’04, 2004.  B. Waters, D. Balfanz, G. Durfee, and D. Smetters, “Building an encrypted and searchable audit log,” in Proc. of 11th Annual Network and Distributed System, 2004.
 Y.-C. Chang and M. Mitzenmacher, “Privacy preserving keyword searches on remote encrypted data,” in Proc. of ACNS’05, 2005.
 R. Curtmola, J. A. Garay, S. Kamara, and R. Ostrovsky, “Searchable symmetric encryption: improved definitions and efficient constructions,” in Proc. of ACM CCS’06, 2006.
 D. Boneh and B. Waters, “Conjunctive, subset, and range queries on encrypted data,” in Proc. of TCC’07, 2007, pp. 535–554.
 F. Bao, R. Deng, X. Ding, and Y. Yang, “Private query on encrypted data in multi-user settings,” in Proc. of ISPEC’08, 2008.
 C. Li, J. Lu, and Y. Lu, “Efficient merging and filtering algorithms for approximate string searches,” in Proc. of ICDE’08, 2008.
 J. Feigenbaum, Y. Ishai, T. Malkin, K. Nissim, M. Strauss, and R. N.Wright “Secure multiparty computation of approximations,” in Proc. of ICALP`01.
 R. Ostrovsky, “Software protection and simulations on oblivious rams,” Ph.D dissertation, Massachusetts Institute of Technology, 1992.
 V. Levenshtein, “Binary codes capable of correcting spurious insertions and deletions of ones,” Problems of Information Transmission, vol. 1,no.1, pp. 8–17, 1965.
 Google, “Britney spears spelling correction,” Referenced online at http://www.google.com/jobs/britney.html,June 2009.
 M. Bellare, A. Boldyreva, and A. O’Neill, “Deterministic and efficiently searchable encryption,” in Proceedings of Crypto 2007, volume 4622 of LNCS. Springer-Verlag, 2007.
 D. Song, D. Wagner, and A. Perrig, “Practical techniques for searches on encrypted data,” in Proc. of IEEE Symposium on Security and Privacy’00, 2000.
 E.-J. Goh, “Secure indexes,” Cryptology ePrint Archive, Report 003/216,2003, http://eprint.iacr.org/.
 D. Boneh, G. D. Crescenzo, R. Ostrovsky, and G. Persian
KeywordsPeer-to-peer, performance analysis, search algorithm.