Keyword Search and Dual-Server Public-Key Encryption for Secure Cloud Storage

Authors

  • Asmayeen  M.Tech Student- CSE, Department of Computer Science Engineering, Dr. V. R. K. Women’s College of Engineering & Technology, Hyderabad, Telangana, India
  • Dr. B. Sasi Kumar  Principal & Professor, Department of Computer Science Engineering, Dr. V. R. K. Women’s College of Engineering & Technology, Hyderabad, Telangana, India

Keywords:

Location-Based Social Network, Text Mining, Travel Route Recommendation

Abstract

A growing number of people are interested in searchable encryption to safeguard the privacy of their data in secure searchable cloud storage. In this research, we examine the security of public key encryption with keyword search (PEKS), a widely used cryptographic fundamental with several applications in cloud storage. Unfortunately, it has been established that the conventional PEKS architecture has a flaw known as an inside keyword guessing attack (KGA) that is perpetrated by a rogue server. We suggest the dual-server PEKS framework as a new PEKS framework to remedy this security flaw (DS-PEKS). One further significant addition is the definition of a new type of smooth projective hash function (SPHF) called a linear and homomorphic SPHF (LH-SPHF). Then, using LH-SPHF, we demonstrate a generic construction of secure DS-PEKS. We propose an effective instantiation of the general framework from a Decision Diffie-Hellman-based LH-SPHF and demonstrate that it can accomplish the strong security inside the KGA to demonstrate the viability of our new framework.

References

  1. R. Chen, Y. Mu, G. Yang, F. Guo, and X. Wang, “A new general framework for secure public key encryption with keyword search,” in Proc. 20th Australasian Conf. Inf. Secur. Privacy (ACISP), 2015, pp. 59–76.
  2. D. X. Song, D. Wagner, and A. Perrig, “Practical techniques for searches on encrypted data,” in Proc. IEEE Symp. Secur. Privacy, May 2000, pp. 44–55.
  3. R. Agrawal, J. Kiernan, R. Srikant, and Y. Xu, “Order preserving encryption for numeric data,” in Proc. ACM SIGMOD Int. Conf. Manage. Data, 2004, pp. 563–574.
  4. R. Curtmola, J. Garay, S. Kamara, and R. Ostrovsky, “Searchable symmetric encryption: Improved definitions and efficient constructions,” in Proc. 13th ACM Conf. Comput. Commun. Secur. (CCS), 2006, pp. 79–88.
  5. D. Boneh, G. Di Crescenzo, R. Ostrovsky, and G. Persiano, “Public key encryption with keyword search,” in Proc. Int. Conf. EUROCRYPT, 2004, pp. 506–522.
  6. R. Gennaro and Y. Lindell, “A framework for password-based authenticated key exchange,” in Proc. Int. Conf. EUROCRYPT, 2003, pp. 524–543.
  7. B. R. Waters, D. Balfanz, G. Durfee, and D. K. Smetters, “Building an encrypted and searchable audit log,” in Proc. NDSS, 2004, pp. 1–11.
  8. M. Abdalla et al., “Searchable encryption revisited: Consistency properties, relation to anonymous IBE, and extensions,” in Proc. 25th Annu. Int. Conf. CRYPTO, 2005, pp. 205–222.
  9. D. Khader, “Public key encryption with keyword search based on K-resilient IBE,” in Proc. Int. Conf. Comput. Sci. Appl. (ICCSA), 2006, pp. 298–308.
  10. P. Xu, H. Jin, Q. Wu, and W. Wang, “Publickey encryption with fuzzy keyword search: A provably secure scheme under keyword guessing attack,” IEEE Trans.

International Journal of Scientific Research in Science, Engineering and Technology

Downloads

Published

2022-10-30

Issue

Volume 9, Issue 5, September-October-2022

Section

Research Articles

License

Copyright (c) IJSRSET

Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.

How to Cite

[1]
Asmayeen, Dr. B. Sasi Kumar "Keyword Search and Dual-Server Public-Key Encryption for Secure Cloud Storage" International Journal of Scientific Research in Science, Engineering and Technology (IJSRSET), Print ISSN : 2395-1990, Online ISSN : 2394-4099, Volume 9, Issue 5, pp.217-223, September-October-2022.