The Efficient and probabilistic symmetric searchable encryption scheme in Cloud

D. Vijaya Durga, A.P.V.D.L. Kumar

Abstract


Cloud have enormous storage space for storing immense size of data. Data owner redistribute their data substance on cloud server. Cloud server can have enormous storage space. In this paper, data client demand for data to the cloud server. Data owner produce encryption key for each datum client which mentioned for data files. Because of this, data stays secure and precise data may looked by semantic pursuit. Additionally the data spillage is limited because of the cloud storage framework. Calculation can be utilized for encryption system. Key age is performed by data administrator for protection safeguarding. Presently multi day's there will develop prominence of cloud computing, huge number of clients and data proprietors are spurred to re-appropriate their data to cloud servers for enormous comfort and decreased cost required for data the board. Be that as it may, significant data ought to be scrambled before redistributing for security necessities, which uses data use strategy like watchword based archive recovery. Accessible encryption is of extending energy for guaranteeing the data assurance in secure accessible circulated storage. In this paper, we explore the security of a remarkable cryptographic crude, specifically, open key encryption with watchword search which is incredibly significant in various uses of cloud storage.


References


A New Lightweight Symmetric Searchable Encryption Scheme for String Identification Indranil Ghosh Ray, Yogachandran Rahulamathavan and Muttukrishnan Rajarajan, Senior Member, IEEE 2168-7161 (c) 2018 IEEE.

Ming Liu and Rafael A. Calvo, “Secure ranked keyword search over encrypted cloud data,” in Proc. IEEE 30th Int. Conf. Distrib. Comput. Syst. (ICDCS), Jun. 2012, pp. 253–262, 2012.

Ning Cao, Cong Wang[2014], “PrivacyPreserving Multi-keyword Ranked Search over Encrypted Cloud Data” in Proc. Of EDBT, 2014, pp. 287–298, 2014.

Q. Wang, C. Wang, K. Ren, W. Lou, and J. Li, “Enabling public auditability and data dynamics for storage security in cloud computing,”IEEE Trans. Parallel Distrib. Syst., vol. 22, no. 5, pp. 847–859, 2009.

Reza Curtmola[2006], “Efficient multi-keyword ranked query over encrypted data in cloud computing,” Future Generat. Comput. Syst., vol. 30, pp. 179–190, 2006.

RuixuanLi Zhiyong Xu [2014] “Efficient multikeyword ranked query over encrypted data in cloud computing” IEEE Trans.Parallel Distrib. Syst., vol. 25, no. 1, pp. 222–233, Jan. 2014.

R.V.V Murali Krishna and Ch. Satyananda Reddy, “Privacy-preserving multi-keyword text search in the cloud supporting similarity-based ranking,” in Proc. 8th ACM SIGSAC Symp. Inf., Comput. Commun. Secur., 2012, pp. 71–82.

P.Sridevi et al [2017] “An Efficient EncryptionThen-Compression System using Asymmetric Numeral Metho”, International Journal of Engineering and Technology (IJET), Vol 9 No 5 OctNov 2017, ISSN (Print) : 2319-8613,ISSN (Online) : 0975-4024.

Z. Xia, X. Wang, X. Sun, and Q. Wang, “A secure and dynamic multikeywordranked search scheme over encrypted cloud data,” IEEE Trans.Parallel Distrib. Syst., vol. 27, no. 2, pp. 340– 352, 2015.

Zhihua Xia,“A Secure and Dynamic Multikeyword RankedSearch Scheme over Encrypted Cloud Data”, Ieee Transactions On Parallel And Distributed Systems Vol: Pp No: 99 Year 2015.


Full Text: PDF [Full Text]

Refbacks

  • There are currently no refbacks.


Copyright © 2013, All rights reserved.| ijseat.com

Creative Commons License
International Journal of Science Engineering and Advance Technology is licensed under a Creative Commons Attribution 3.0 Unported License.Based on a work at IJSEat , Permissions beyond the scope of this license may be available at http://creativecommons.org/licenses/by/3.0/deed.en_GB.