Lattice-based searchable encryption scheme against inside keywords guessing attack

被引:0
|
作者
Yu X. [1 ]
Xu C. [1 ]
Xu L. [1 ]
Wang Y. [2 ]
机构
[1] School of Science, Nanjing University of Science and Technology, Nanjing
[2] School of Information Science, Security and Networks, Japan Advanced Institute of Science and Technology, Ishikawa
来源
Computers, Materials and Continua | 2020年 / 64卷 / 02期
关键词
Guessing attack; Post-quantum secure;
D O I
10.32604/CMC.2020.09680
中图分类号
学科分类号
摘要
To save the local storage, users store the data on the cloud server who offers convenient internet services. To guarantee the data privacy, users encrypt the data before uploading them into the cloud server. Since encryption can reduce the data availability, public-key encryption with keyword search (PEKS) is developed to achieve the retrieval of the encrypted data without decrypting them. However, most PEKS schemes cannot resist quantum computing attack, because the corresponding hardness assumptions are some number theory problems that can be solved efficiently under quantum computers. Besides, the traditional PEKS schemes have an inherent security issue that they cannot resist inside keywords guessing attack (KGA). In this attack, a malicious server can guess the keywords encapsulated in the search token by computing the ciphertext of keywords exhaustively and performing the test between the token and the ciphertext of keywords. In the paper, we propose a lattice-based PEKS scheme that can resist quantum computing attacks. To resist inside KGA, this scheme adopts a lattice-based signature technique into the encryption of keywords to prevent the malicious server from forging a valid ciphertext. Finally, some simulation experiments are conducted to demonstrate the performance of the proposed scheme and some comparison results are further shown with respect to other searchable schemes. © 2020 Tech Science Press. All rights reserved.
引用
收藏
页码:1107 / 1125
页数:18
相关论文
共 50 条
  • [1] Lattice-Based Searchable Encryption Scheme against Inside Keywords Guessing Attack
    Yu, Xiaoling
    Xu, Chungen
    Xu, Lei
    Wang, Yuntao
    CMC-COMPUTERS MATERIALS & CONTINUA, 2020, 64 (02): : 1107 - 1125
  • [2] Lattice-Based Searchable Encryption With Keywords Revocable and Bounded Trapdoor Exposure Resistance
    Yu, Xiaoling
    Xu, Chungen
    Xu, Lei
    IEEE ACCESS, 2019, 7 : 43179 - 43189
  • [3] A lattice-based searchable encryption scheme with the validity period control of files
    En Zhang
    Yingying Hou
    Gongli Li
    Multimedia Tools and Applications, 2021, 80 : 4655 - 4672
  • [4] A lattice-based searchable encryption scheme with the validity period control of files
    Zhang, En
    Hou, Yingying
    Li, Gongli
    MULTIMEDIA TOOLS AND APPLICATIONS, 2021, 80 (03) : 4655 - 4672
  • [5] Fast Public Key Searchable Encryption Scheme against Internal Keyword Guessing Attack in Cloud Environment
    Chen N.
    Liu C.
    Huang R.
    Huang B.
    Dianzi Yu Xinxi Xuebao/Journal of Electronics and Information Technology, 2021, 43 (02): : 467 - 474
  • [6] An efficient public-key searchable encryption scheme secure against inside keyword guessing attacks
    Huang, Qiong
    Li, Hongbo
    INFORMATION SCIENCES, 2017, 403 : 1 - 14
  • [7] Lattice-based searchable public-key encryption scheme for secure cloud storage
    Xie, Run
    Xu, Chunxiang
    He, Chanlian
    Zhang, Xiaojun
    INTERNATIONAL JOURNAL OF WEB AND GRID SERVICES, 2018, 14 (01) : 3 - 20
  • [8] Lattice-based certificateless encryption scheme
    Jiang, Mingming
    Hu, Yupu
    Lei, Hao
    Wang, Baocang
    Lai, Qiqi
    FRONTIERS OF COMPUTER SCIENCE, 2014, 8 (05) : 828 - 836
  • [9] Lattice-based certificateless encryption scheme
    Mingming Jiang
    Yupu Hu
    Hao Lei
    Baocang Wang
    Qiqi Lai
    Frontiers of Computer Science, 2014, 8 : 828 - 836
  • [10] An efficient and secure certificateless searchable encryption scheme against keyword guessing attacks
    Senouci, Mohammed Raouf
    Benkhaddra, Ilyas
    Senouci, Abdelkader
    Li, Fagen
    JOURNAL OF SYSTEMS ARCHITECTURE, 2021, 119