Multi-Recipient encryption with keyword search without pairing for cloud storage

被引:0
作者
Ningbin Yang
Quan Zhou
Qiong Huang
Chunming Tang
机构
[1] Guangzhou University,School of Mathematics and Information Science
[2] South China Agricultural University,College of Mathematics and Informatics
来源
Journal of Cloud Computing | / 11卷
关键词
Cloud storage; Multi-Recipient; Public key encryption; Keyword guessing attacks;
D O I
暂无
中图分类号
学科分类号
摘要
With the rapid development of cloud computing technology and communication technology, cloud storage has become a tool used by people in daily life. Cloud storage service enables users to outsource data to cloud servers and retrieve desired document efficiently. Individual privacy in outsource data are very sensitive and should be prevented from any leakage. Public-key encryption with keyword search (PEKS) scheme resolves this tension, while public-key authentication encryption with keyword search (PAEKS) scheme improve its keyword guessing attacks problem potentially. Whereas, the loss of keyword privacy, the limitation of single user interaction and low efficiency make PEKS/PAEKS schemes far from enough in practical applications.In this paper, we develop a multi-recipient public key encryption scheme with keyword search without pairing (MREKS) for cloud storage under public key infrastructure. The proposed scheme has the merits of supporting multi-recipient keyword search way as well as requiring no expensively bilinear pairing operations under standard model. We present a concrete and efficient construction of MREKS, and prove its security based on discrete logarithm assumptions. Furthermore, we embed the algorithm of data plaintext encryption and decryption into the scheme, which makes the scheme more practical. We show that our scheme enjoys much more efficiency than previous PEKS/PAEKS scheme in the simulation experiment, especially the keyword encryption is optimized by 79.5%.
引用
收藏
相关论文
共 67 条
[1]  
Fang L(2013)Public key encryption with keyword search secure against keyword guessing attacks without random oracle Inf Sci 238 221-241
[2]  
Susilo W(2010)Trapdoor security in a searchable public-key encryption scheme with a designated tester J Syst Softw 83 763-771
[3]  
Ge C(2017)An efficient public-key searchable encryption scheme secure against inside keyword guessing attacks Inf Sci 403-404 1-14
[4]  
Wang J(2020)Privacy-preserving and pairing-free multirecipient certificateless encryption with keyword search for cloud-assisted iiot IEEE Internet Things J 7 2553-2562
[5]  
Rhee HS(2021)Public-key authenticated encryption with keyword search achieving both multi-ciphertext and multi-trapdoor indistinguishability J Syst Archit 115 102075-528
[6]  
Park JH(2021)Security analysis of pan et al.’s “public-key authenticated encryption with keyword search achieving both multi-ciphertext and multi-trapdoor indistinguishability” J Syst Archit 119 102248-767
[7]  
Susilo W(2020)Public-key authenticated encryption with keyword search revisited: Security model and constructions Inf Sci 516 515-276
[8]  
Lee DH(2018)Certificateless searchable public key encryption scheme for industrial internet of things IEEE Trans Ind Inform 14 759-890
[9]  
Huang Q(2019)Keyword guessing attacks on a public key encryption with keyword search scheme without random oracle and its improvement Inf Sci 479 270-2842
[10]  
Li H(2020)Certificateless searchable public key encryption scheme secure against keyword guessing attacks for smart healthcare J Inf Secur Appl 50 102429-3627