Email this article A secured Multi keyword Ranked Search Scheme for Encrypted Data in Cloud Storage
Abstract
Cloud computing condition gives on-request access to shared assets that can be made do with insignificant communication of cloud specialist organization and approved support of the client. Cloud stockpiling can be either open or private. Information in the open stockpiling can be seen by all cloud clients. The private information can be seen by the approved client as it were. This paper upgrade the security of the cloud information utilizing Advanced Encryption Standard (AES) encryption algorithm. Information proprietors are persuaded to re-appropriate their information in cloud servers for incredible comfort. Private information ought to be scrambled before redistributing by utilizing keys. Encryption is a significant idea in cloud computing to keep up the database. Existing framework kept up the database by giving secret key to records and archives. The proposed framework gives keys to get to the document and keys are kept up as private and keys are given by the information proprietor. The paper centered ostrovsky conspire (private data recovery) that enables a client to recover document with no data spillage. Trial result are exhibited to test the security of AES algorithm and data spillage.
References
M. Armbrust, A. Fox, R. Griffith, A. D. Joseph, R. Katz, A. Konwinski, G. Lee, D. Patterson, A. Rabkin, I. Stoica, and M. Zaharia, “A view of cloud computing,” Communication of the ACM, vol. 53, no. 4, pp. 50–58, 2010.
C. Wang, S. S. Chow, Q. Wang, K. Ren, and W. Lou, “Privacypreserving public auditing for secure cloud storage,” Computers, IEEE Transactions on, vol. 62, no. 2, pp. 362–375, 2013. [3] D.Song, D.Wagner, and A.Perrig, “Practical techniques for searches on encrypted data,” in Proc. IEEE International Symposium on Security and Privacy (S&P’00), Nagoya, Japan, Jan.2000, pp. 44–55.
E. Goh. (2003) Secure indexes. [Online]. Available: http://eprint.iacr.org/
R. Curtmola, J. Garay, S. Kamara, and R. Ostrovsky, “Searchable symmetric encryption: improved definitions and efficient constructions,” in Proc. ACM CCS’06, VA, USA, Oct. 2006, pp. 79–88.
D. B. et al., “Public key encryption with keyword search secure against keyword guessing attacks without random oracle,” EUROCRYPT, vol. 43, pp. 506–522, 2004.
P. Golle, J. Staddon, and B. Waters, “Secure conjunctive keyword search over encrypted data,” in Proc. Applied Cryptography and Network Security (ACNS’04), Yellow Mountain, China, Jun. 2004, pp. 31–45.
L. Ballard, S. Kamara, and F. Monrose, “Achieving efficient conjunctive keyword searches over encrypted data,” in Proc. Information and Communications Security (ICICS’05), Beijing, China, Dec. 2005, pp. 414–426.
C. Wang, N. Cao, J. Li, K. Ren, and W. Lou, “Secure ranked keyword search over encrypted cloud data,” in Proc. IEEE Distributed Computing Systems (ICDCS’10), Genoa, Italy, Jun. 2010, pp. 253–262.
N. Cao, C. Wang, M. Li, K. Ren, and W. Lou, “Privacy preserving multi-keyword ranked search over encrypted cloud data,” in Proc. IEEE INFOCOM’11, Shanghai, China, Apr. 2011, pp. 829–837.
Refbacks
- There are currently no refbacks.
Copyright © 2013, All rights reserved.| ijseat.com
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.