Efficient Public Encryption Scheme with Keyword Search for Cloud Storage

被引:0
|
作者
Guo L. [1 ,2 ]
Li Z. [1 ]
Hu L. [3 ]
机构
[1] School of Computer and Information Technology, Shanxi University, Taiyuan
[2] Research Institute of Big Data Science and Industry, Shanxi University, Taiyuan
[3] State Key Laboratory of Information Security, Institute of Information Engineering, Chinese Academy of Sciences, Beijing
基金
中国国家自然科学基金;
关键词
Bilinear pairing; Keyword search; Online and offline keyword guessing attacks; Searchable encryption; Trapdoor;
D O I
10.7544/issn1000-1239.2020.20190671
中图分类号
学科分类号
摘要
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. © 2020, Science Press. All right reserved.
引用
收藏
页码:1404 / 1414
页数:10
相关论文
共 29 条
  • [1] Boneh D, Di C G, Ostrovsky R, Et al., Public key encryption with keyword search, LNCS 3027: Proc of the 23rd Int Conf on the Theory and Application of Cryptographic Techniques, pp. 506-522, (2004)
  • [2] Boneh D, Franklin M., Identity-based encryption from the weil pairing, LNCS 2139: Proc of the CRYPTO 2001, pp. 213-229, (2001)
  • [3] Baek J, Safavinaini R, Susilo W., Public key encryption with keyword search revisited, LNCS 5072: Proc of 2008 Int Conf on Computation Science and Its Aplications, pp. 1249-1259, (2008)
  • [4] Rhee H S, Park J H, Susilo W, Et al., Trapdoor security in a searchable public-key encryption scheme with a designated tester, Journal of Systems and Software, 6, 5, pp. 237-243, (2010)
  • [5] Rhee H S, Park J H, Susilo W, Et al., Improved searchable public key encryption with designated tester, Proc of the 4th International Symposium on Information, Computer, and Communications Security, pp. 376-379, (2009)
  • [6] Fang Liming, Susilo W, Ge Chunpeng, Et al., A secure channel free public key encryption with keyword search scheme without random oracle, LNCS 5888: Proc of CANS 2009, pp. 248-258, (2009)
  • [7] Gentry C., Practical identity-based encryption without random oracles, Proc of the 25th Annual Int Conf on the Theory and Applications of Cryptographic Techniques, pp. 445-464
  • [8] Fang Liming, Susilo W, Ge Chunpeng, Et al., Public key encryption with keyword search secure against keyword guessing attacks without random oracle, Information Sciences, 238, 7, pp. 221-241, (2013)
  • [9] Byun J W, Rhee H S, Park H A, Et al., Off-line keyword guessing attacks on recent keyword search schemes over encrypted data, Proc of the 3rd VLDB Workshop on Secure Data Management(SDM 2006), pp. 75-83, (2006)
  • [10] Park D, Kim K, Lee P J., Public key encryption with conjunctive field keyword search, Proc of Int Conf on Information Security Applications, pp. 73-86, (2004)