Public-Key Authenticated Encryption with Keyword Search Without Pairings

被引:0
|
作者
Yang N. [1 ]
Zhou Q. [1 ]
Xu S. [1 ]
机构
[1] School of Mathematics and Information Science, Guangzhou University, Guangzhou
基金
中国国家自然科学基金;
关键词
Authentication; Keyword guessing attacks; Multi-keyword ciphertext security; Non bilinear pairs; Public key; Searchable encryption;
D O I
10.7544/issn1000-1239.2020.20200318
中图分类号
学科分类号
摘要
With the rapid development and wide application of cloud computing and 5G communication, the number of cloud mobile users has increased rapidly. The privacy protection of cloud data is getting more and more attention. Public key encryption scheme with keyword search (PEKS) and secure channel free public key encryption with keyword search (SCF-PEKS) allow any user in the system to send encrypted files to the server for retrieval by the receiver, which plays a certain role of privacy protection. However, Rhee et al. found that the scheme may result in loss of privacy security of keywords in their work. Meanwhile, many of public-key searchable encryption schemes are calculated based on bilinear pairings, and their computational efficiency is limited on battery-limited devices. To address these issue, we propose a non bilinear pairs secure channel free public key authentication encryption with keyword search scheme (NBP-SCF-PAEKS). The scheme has higher computational efficiency than the bilinear pair scheme, and has access control function in keyword retrieval process. Without random oracle model, we prove that the scheme can resist the online keyword guessing attack and the offline keyword guessing attack, by ensuring the multi-keyword ciphertext indistinguishability under adaptive chosen keyword attack and the keyword trapdoor indistinguishability under adaptive chosen keyword attack through game-hopping method. Compared with other schemes, the simulation results show that the scheme is efficient and secure. © 2020, Science Press. All right reserved.
引用
收藏
页码:2125 / 2135
页数:10
相关论文
共 29 条
  • [1] Song D X, Wagner D, Perrig A., Practical techniques for searches on encrypted data, Proc of 2000 IEEE Symp on Security and Privacy (S&P 2000), pp. 44-55, (2000)
  • [2] Boneh D, Di C G, Ostrovsky R, Et al., Public key encryption with keyword search, Proc of Int Conf on the Theory and Applications of Cryptographic Techniques, pp. 506-522, (2004)
  • [3] Baek J, Safavi-Naini R, Susilo W., Public key encryption with keyword search revisited, Proc of Int Conf on Computational Science and Its Applications, pp. 1249-1259, (2008)
  • [4] Huang Qiong, Li Hongbo, An efficient public-key searchable encryption scheme secure against inside keyword guessing attacks, Information Sciences, 403, pp. 1-14, (2017)
  • [5] Wu T Y, Chen C M, Wang K H, Et al., Security analysis of a public key authenticated encryption with keyword search scheme, Proc of Int Conf on Intelligent Information Hiding and Multimedia Signal Processing, pp. 178-183, (2018)
  • [6] Lu Yang, Li Jiguo, Zhang Yichen, SCF-PEPCKS: Secure channel free public key encryption with privacy-conserving keyword search, IEEE Access, 7, pp. 40878-40892, (2019)
  • [7] Hwang M S, Lee C C, Hsu S T., An ElGamal-like secure channel free public key encryption with keyword search scheme, International Journal of Foundations of Computer Science, 30, 2, pp. 255-273, (2019)
  • [8] Qin Baodong, Chen Yu, Huang Qiong, Et al., Public-key authenticated encryption with keyword search revisited: Security model and constructions, Information Sciences, 516, pp. 515-528, (2020)
  • [9] Yau W C, Heng S H, Goi B M., Off-line keyword guessing attacks on recent public key encryption with keyword search schemes, Proc of Int Conf on Autonomic and Trusted Computing, pp. 100-105, (2008)
  • [10] Fang L, Susilo W, Ge C, Et al., A secure channel free public key encryption with keyword search scheme without random oracle, Proc of Int Conf on Cryptology and Network Security, pp. 248-258, (2009)