Efficient Search On Encrypted Files In Cloud

Anusha Kada, Aditya Ramalingeswararao

Abstract


A progressive characteristic based encryption conspires is first intended for an document collection. A lot of archives can be scrambled together on the off chance that they share an incorporated access structure. Contrasted and the Ciphertext-Policy Attribute-Based Encryption (CP-ABE) plans, both the Ciphertext extra room and time expenses of encryption/unscrambling are spared. At that point, a document structure named Attribute-Based Retrieval features (ARF) tree is developed for the archive accumulation dependent on the Term Frequency-Inverse Document Frequency(TF-IDF) show and the reports' qualities. A profundity first search calculation for the ARF tree is intended to improve the hunt effectiveness which can be additionally improved by parallel computing. With the exception of the archive accumulations, our plan can be additionally connected to different datasets by altering the ARF tree slightly.

References


K. Ren, C. Wang, and Q. Wang, “Security challenges for the public cloud,†IEEE Internet Computing, vol. 16, pp. 69–73, Jan. 2012.

D. X. Song, D. Wagner, and A. Perrig, “Practical techniques for searches on encrypted data,†in Security and Privacy, 2000. SandP 2000. Proceedings. 2000 IEEE Symposium on, pp. 0–44, 2002.

E. J.Goh, “Secure indexes,†Cryptology ePrint Archive, http:// eprint.iacr.org/2003/216., 2003.

R. Curtmola, J. Garay, S. Kamara, and R. Ostrovsky, “Searchable symmetric encryption: improved deï¬nitions and efï¬cient constructions,†in ACM Conference on Computer and Communications Security, pp. 79– 88, 2006.

J. Li, Y. Shi, and Y. Zhang, “Searchable ciphertext-policy attribute-based encryption with revocation in cloud storage,†International Journal of Communication Systems, vol. 30, no. 1, 2017.

Y. Miao, J. Ma, X. Liu, X. Li, Q. Jiang, and J. Zhang, “Attribute based keyword search over hierarchical data in cloud computing,†IEEE Transactions on Services Computing, vol. PP, no. 99, pp. 1–1, 2017.

A Swam in a than, Y Mao, G.M.Su , H.Gou, A.L.Varna, S. He, M. Wu, and D. W. Oard, “Conï¬dentiality-preserving rank-ordered search,†in ACM Workshop on Storage Security and Survivability, Storages 2007, Alexandria,Va, Usa, October, pp. 7–12, 2007.

C.Wang,N.Cao, K. Ren, and W. Lou, “Enabling secure and efï¬cient ranked keyword search over outsourced cloud data,†IEEE Transactions on Parallel and Distributed Systems, vol. 23, pp. 1467–1479, Aug. 2012.

S. Zerr D. Olmedilla, W. Nejdl, and W.Siberski, “Zerber +r :topk retrieval from a conï¬dential index,†in International Conference on Extending Database Technology: Advances in Database Technology, pp. 439–449, 2009.

P.Golle, J.Staddon, and B.Waters, “Secure conjunctive keyword search over encrypted data,†Lecture Notes in Computer Science, vol. 3089, pp. 31–45, 2004.


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.

Â