ISSN 1000-1239 CN 11-1777/TP

计算机研究与发展 ›› 2020, Vol. 57 ›› Issue (7): 1404-1414.doi: 10.7544/issn1000-1239.2020.20190671

• 信息安全 • 上一篇    下一篇



  1. 1(山西大学计算机与信息技术学院 太原 030006);2(山西大学大数据科学与产业研究院 太原 030006);3(信息安全国家重点实验室(中国科学院信息工程研究所) 北京 100093) (
  • 出版日期: 2020-07-01
  • 基金资助: 

Efficient Public Encryption Scheme with Keyword Search for Cloud Storage

Guo Lifeng1,2, Li Zhihao1, Hu Lei3   

  1. 1(School of Computer and Information Technology, Shanxi University, Taiyuan 030006);2(Research Institute of Big Data Science and Industry, Shanxi University, Taiyuan 030006);3(State Key Laboratory of Information Security (Institute of Information Engineering, Chinese Academy of Sciences), Beijing 100093)
  • Online: 2020-07-01
  • Supported by: 
    This work was supported by the General Program of the Natural Science Foundation of Shanxi Province of China (201901D111029), the Key Reseach and Development Program (International Science and Technology Cooperation Project) of Shanxi Province of China (201903D421003), the National Natural Science Foundation of China (61202365, 61872226, 61732021), the Natural Science Foundation of Shanxi Province of China (201701D121052), and the Scientific and Technological Innovation Programs of Higher Education Institutions in Shanxi Province (STIP) (2019L0114).

摘要: 广泛应用于云存储环境的带关键词搜索的公钥加密体制(public key encryption with keyword search, PEKS)不仅能保证所存储数据的隐私,而且具有搜索功能. 针对抵制内部离线关键词猜测攻击问题,目前的解决方案是通过引入发送者的私钥,使得密文实现认证功能,从而抵制内部的离线关键词猜测攻击,但是此方法使得接收者必须事先指定发送者,这不符合实际要求. 为此,提出一个高效的带关键词搜索的公钥加密方案而且在标准模型下可证明安全. 该方案有3个优势:1)通过引入发送者和服务器的身份,实现了抵制内部和外部离线关键词猜测攻击,而且不需要接收者指定发送者;2)通过引入服务器的公私钥对,陷门可以在公开信道传输;3)因为任何人都可验证关键词密文的正确性,该方案能够抵制选择关键词密文攻击.

关键词: 可搜索加密, 关键词搜索, 在线和离线的关键词猜测攻击, 双线性对, 陷门

Abstract: Public key encryption with keyword search (PEKS) is a promise cryptography technique in cloud storage which not only can ensure the privacy of stored data but also has search function. In order to resist internal off-line keyword guessing attack, the current solution is to introduce the sender’s secret key and public key to make the keyword ciphertext to realize authentication function. But in these schemes, the receiver must delegate the sender in advance. This situation does not meet the actual requirements that the receiver does not want to delegate the sender. In order to satisfy these applications, we propose an efficient PEKS scheme and prove its security in the standard model. Our PEKS scheme achieves three advantages: Firstly, by introducing the identity of the sender and the server, our scheme can resist the internal and external off-line keyword guessing attack. Furthermore, the scheme doesn’t need to delegate the sender; secondly, by introducing the server’s private key and public key, the trapdoor can be transmitted by a public channel; thirdly, because anyone can verify the correctness of the keyword search ciphertext of keyword search, the scheme can resist chosen keyword ciphertext attack.

Key words: searchable encryption, keyword search, online and offline keyword guessing attacks, bilinear pairing, trapdoor