Education, Science, Technology, Innovation and Life
Open Access
Sign In

A Public Key Searchable Encryption Method Based on Multiple Keywords

Download as PDF

DOI: 10.23977/jeis.2023.080101 | Downloads: 26 | Views: 452


Wenrui Ji 1, Yan Wang 1, Xin Luo 1, Li Li 2, Guangwei Xu 1, Wei Li 1


1 School of Computer Science and Technology, Donghua University, Shanghai, 201620, China
2 School of Architecture and Urban Planning, Tongji University, Shanghai, 200082, China

Corresponding Author

Li Li


In recent years, the secure search of encrypted cloud data has become a hot research topic and a challenging task. Several secure search schemes have been proposed to address this challenge. However, existing public-key searchable encryption schemes still face many problems. Among these schemes, most of them are based on single-key searchable encryption schemes, and although some schemes are designed for multi-key search, they still disclose the secret information of the encrypted index. Based on this, this paper proposes a multi-key public-key searchable encryption scheme without a secure channel, which uses a random element padding method to construct an encrypted index to ensure the security of the index information, and then improves the efficiency of the search by aggregating the query keyword information to generate query trapdoors. The simulation results of the algorithm show that the algorithm improves the query efficiency and query accuracy under the condition that the index and trapdoor are secure.


Searchable encryption, multi-keyword, random element padding


Wenrui Ji, Yan Wang, Xin Luo, Li Li, Guangwei Xu, Wei Li, A Public Key Searchable Encryption Method Based on Multiple Keywords. Journal of Electronics and Information Science (2023) Vol. 8: 1-8. DOI:


[1] Ali M, Khan S U, Vasilakos A V. Security in cloud computing: opportunities and challenges [J]. Information sciences, 2015, 305: 357-383.
[2] D. X. Song, D. Wagner, A. Perrig. Practical Techniques for Searches on Encrypted Data [C]// IEEE Symposium on Security & Privacy. IEEE, 2002.
[3] Dan B, Crescenzo G D, Ostrovsky R, et al. Public Key Encryption with Keyword Search [J]. EUROCRYPT 2004, 2004.
[4] J. Baek, R. Safavi-Naini and W. Susilo. Public Key Encryption with Keyword Search Revisited[C]. In Proc. of Applied Cryptography and Information Security 06 (ACIS 2006), LNCS 5072, Springer-Verlag, 2008:1249-1259.
[5] C. Gu, Y Zhu, and H. Pan. Efficient Public Key Encryption with Keyword Search Schemes from Pairings[C]. In Proc. of Information Security and Cryptology: Third SKLOIS Conference, Inscrypt 2007, LNCS 4990, Springer-Verlag, 2007:372-383.
[6] H. S. Rhee, J. H. Park, W. Susilo, and D. H. Lee. Improved searchable public key encryption with designated tester. Proc. of the 4th international Symposium on information, Computer, and Communications Security, ASIACCS 2009, ACM, New York, NY, 2009:376-379.
[7] Fang L, Susilo W, Ge C, et al. Public key encryption with keyword search secure against keyword guessing attacks without random oracle [J]. Information Sciences, 2013, 238: 221-241. 
[8] Z. Fu, K. Ren, J. Shu, X. Sun, F. Huang, Enabling personalized search over encrypted outsourced data with efficiency improvement, IEEE Trans. Parallel Distrib. Syst. 27 (9) (2016) 2546-2559.
[9] Huang Qiong, Li Hong-bo. An efficient public-key searchable encryption scheme secure against inside keyword guessing attacks [J]. Information Sciences, 2017, s 403-404:1-14.
[10] Curtmola R, Garay J, Kamara S, et al. Searchable symmetric encryption: improved definitions and efficient constructions[C]//Proceedings of the 13th ACM conference on Computer and communications security. 2006: 79-88.
[11] Yin H, Li Y, Deng H, et al. An Attribute-Based Keyword Search Scheme for Multiple Data Owners in Cloud-Assisted Industrial Internet of Things [J]. IEEE Transactions on Industrial Informatics, 2022.

Downloads: 4716
Visits: 214722

Sponsors, Associates, and Links

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

Copyright © 2016 - 2031 Clausius Scientific Press Inc. All Rights Reserved.