Keyword Searchable Public Key Encryption based on KPABE a Generic Approach
Keywords:
Searchable Encryption, Multi-Keyword Search, Multi-User Access, Search Pattern, Access PatternAbstract
In multi-user environments, implementing multi-keyword searchable systems comes with several major challenges—hiding both the search and access patterns, as well as defending against keyword guessing attacks (KGA). We have proposed a revolutionary new searchable encryption scheme that addresses all issues simultaneously. It renders the scheme very convenient for distribution in distributed systems. The scheme supports multi keyword searches. on encrypted data within a multi-writer and multi-reader framework, all while preserving the confidentiality of both the data and the search behavior.
Downloads
References
“Forecast number of personal cloud storage consumers/users worldwide from 2014 to 2020 (in millions),” https://www.statista.com/statistics/638593/ worldwide-data-center-storage-capacity-cloud-vs-traditional/, accessed August 30, 2018.
D. Boneh, G. Di Crescenzo, R. Ostrovsky, and G. Persiano, “Public key encryption with keyword search,” in International conference on the theory and applications of cryptographic techniques, 2004, pp. 506–522.
J. W. Byun, H. S. Rhee, H.-A. Park, and D. H. Lee, “Off-line keyword guessing attacks on recent keyword search schemes over encrypted data,” in Workshop on Secure Data Management, 2006, pp. 75–83.
Q. Huang and H. Li, “An efficient public-key searchable encryption scheme secure against inside keyword guessing attacks,” Information Sciences, vol. 403, pp. 1–14, 2017.
D. X. Song, D. Wagner, and A. Perrig, “Practical techniques for searches on encrypted data,” in Security and Privacy, 2000. S&P 2000. Proceedings. 2000 IEEE Symposium on, 2000, pp. 44–55.
E.-J. Goh et al., “Secure indexes.” IACR Cryptology ePrint Archive, vol. 2003, p. 216, 2003.
R. Curtmola, J. Garay, S. Kamara, and R. Ostrovsky, “Searchable symmetric encryption: improved definitions and efficient constructions,”JournalofComputerSecurity, vol. 19, no. 5, pp. 895–934, 2011.
K. Kurosawa and Y. Ohtaki, “Uc-secure searchable symmetric encryption,” in International Conference on Financial Cryptography and Data Security, 2012, pp. 285–298.
P. Wang, H. Wang, and J. Pieprzyk, “Keyword field-free conjunctive keyword searches on encrypted data and extension for dynamic groups,” in International conference on cryptology and network security, 2008, pp. 178–195.
B. Zhang and F. Zhang, “An efficient public key encryption with conjunctive-subset keywords search,” Journal of Network and Computer Applications, vol. 34, no. 1, pp. 262–267, 2011.
K. Huang, R. Tso, and Y.-C. Chen, “Somewhat semantic secure public key encryption with filtered-equality-test in the standard model and its extension to searchable encryption,” Journal of Computer and System Sciences, vol. 89, pp. 400–409, 2017.
G. Wang, C. Liu, Y. Dong, P. Han, H. Pan, and B. Fang, “Idcrypt: A multi-user searchable symmetric encryption scheme for cloud applications,” IEEE Access, vol. 6, pp. 2908–2921, 2018.
X. Liu, G. Yang, Y. Mu, and R. Deng, “Multi-user verifiable searchablesymmetricencryptionforcloudstorage,”IEEETransactionson Dependable and Secure Computing, 2018.
A. Fiat and M. Naor, “Broadcast encryption,” in Annual International Cryptology Conference, 1993, pp. 480–491.
D. Cash, S. Jarecki, C. Jutla, H. Krawczyk, M.-C. Ros¸u, and M. Steiner, “Highly-scalable searchable symmetric encryption with support for Boolean queries,”inAnnualCryptologyConference, 2013, pp. 353–373.
Downloads
Published
Issue
Section
License
Copyright (c) 2025 International Journal of Scientific Research in Computer Science, Engineering and Information Technology
This work is licensed under a Creative Commons Attribution 4.0 International License.