Searchable Encryption Based on Key Aggregation

Year : 2024 | Volume :02 | Issue : 01 | Page : 21-25
By

    Nesha Kavya Urs

  1. Lekha Achuth

  1. Student, Department of Computer Applications, People’s Education Society University, Bengaluru, Karnataka, India
  2. Associate Professor, Department of Computer Applications, People’s Education Society University, Bengaluru, Karnataka, India

Abstract

The ability to selectively distribute data with individuals in public cloud services may alleviate safety concerns about inadvertent privacy violations in cloud storage. The need for flexibility in sharing specific sets of documents with various user groups requires the use of distinct encryption keys for each document. This undertaking tackles practical difficulties by presenting the notion of Key-Aggregate Searchable Encryption (KASE). Natural language processing was used to extract essential phrases from a file that would be uploaded by the data owner. It removes the punctuation, special character, and numeric values from the file and finds the term frequency of the remaining keywords. With help of the term frequency, the keyword rank of all the words is derived. This helps in retrieving the file at a faster rate. Hash code is also derived from all these keywords obtained to maintain the security of the file.

Keywords: Key searchable encryption, data sharing, cloud computing, data privacy, searchable encryption

[This article belongs to International Journal of Data Structure Studies(ijdss)]

How to cite this article: Nesha Kavya Urs, Lekha Achuth , Searchable Encryption Based on Key Aggregation ijdss 2024; 02:21-25
How to cite this URL: Nesha Kavya Urs, Lekha Achuth , Searchable Encryption Based on Key Aggregation ijdss 2024 {cited 2024 Mar 11};02:21-25. Available from: https://journals.stmjournals.com/ijdss/article=2024/view=133443


Browse Figures

References

  1. Boneh D, Gentry C, Waters B. Collusion resistant broadcast encryption with short ciphertexts and private keys. In Annual international cryptology conference. Berlin, Heidelberg: Springer Berlin Heidelberg; 2005 Aug 14; 258–275.
  2. Li J, Chen X, Li M, Li J, Lee PP, Lou W. Secure deduplication with efficient and reliable convergent key management. IEEE Trans Parallel Distrib Syst. 2013 Nov 8; 25(6): 1615–25.
  3. Li J, Kim K. Hidden attribute-based signatures without anonymity revocation. Inf Sci. 2010 May 1; 180(9): 1681–9.
  4. Yu S, Wang C, Ren K, Lou W. Achieving secure, scalable, and fine-grained data access control in cloud computing. In 2010 Proceedings IEEE INFOCOM. 2010 Mar 14; 1–9.
  5. Lu R, Lin X, Liang X, Shen X. Secure provenance: the essential of bread and butter of data forensics in cloud computing. In Proceedings of the 5th ACM symposium on information, computer and communications security. 2010 Apr 13; 282–292.
  6. Oliveira LB, Aranha DF, Morais E, Daguano F, López J, Dahab R. Tinytate: Computing the tate pairing in resource-constrained sensor nodes. In 6th IEEE International Symposium on Network Computing and Applications (NCA 2007). 2007 Jul 12; 318–323.
  7. Phan DH, Pointcheval D, Shahandashti SF, Strefler M. Adaptive CCA broadcast encryption with constant-size secret keys and ciphertexts. Int J Inf Secur. 2013 Aug; 12: 251–65.
  8. Chu CK, Chow SS, Tzeng WG, Zhou J, Deng RH. Key-aggregate cryptosystem for scalable data sharing in cloud storage. IEEE Trans Parallel Distrib Syst. 2013 Apr 11; 25(2): 468–77.
  9. Li M, Lou W, Ren K. Data security and privacy in wireless body area networks. IEEE Wirel Commun. 2010 Feb 18; 17(1): 51–8.
  10. Song DX, Wagner D, Perrig A. Practical techniques for searches on encrypted data. In Proceeding 2000 IEEE symposium on security and privacy; S&P 2000. 2000 May 14; 44–55.
Regular Issue Subscription Review Article
Volume 02
Issue 01
Received February 2, 2024
Accepted February 29, 2024
Published March 11, 2024
Views: 95