Lattice-based public-key encryption with conjunctive keyword search in multi-user setting for IIoT

被引:12
|
作者
Tang, Yongli [1 ]
Ba, Yanpeng [1 ]
Li, Lixiang [2 ]
Wang, Xiaojun [3 ]
Yan, Xixi [1 ]
机构
[1] Henan Polytech Univ, Sch Comp Sci & Technol, Jiaozuo 454003, Henan, Peoples R China
[2] Beijng Univ Posts & Telecommun, Informat Secur Ctr, State Key Lab Networking & Switching Technol, Beijing 100876, Peoples R China
[3] Dublin City Univ, Sch Elect Engn, Dublin 9, Ireland
关键词
Public-Key Encryption with keyword Search (PEKS); Industrial Internet of Things (IIoT); Lattice; Multi-user; Conjunctive keyword search; SCHEME;
D O I
10.1007/s10586-021-03488-w
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Most traditional Public-Key Encryption with keyword Search (PEKS) schemes are suffering a tremendous threat occasioned by the burgeoning of quantum computing since these schemes are derived from the bilinear pairing. For the sake of preserving the security of data outsourced by the Industrial Internet of Things (IIoT), a novel efficient PEKS scheme based on lattice assumption is proffered, and it can achieve security against quantum computing attacks. Also, it supports both multi-user and conjunctive keyword search. Besides, we adopt broadcast encryption technology to address the enormous storage cost of keywords ciphertext in a multi-user setting. Our scheme only needs to generate one ciphertext for all data users, thus significantly reducing the storage cost. Lastly, its performance is analyzed theoretically and experimentally. Experimental simulation results demonstrated the superiority of our algorithms in multi-user and multi-keyword scenarios. The scenario of 100 keywords in keyword encryption for 10-100 users always costs about 0.0204 s, and the storage cost keeps at 81.7 KB-84.7 KB.
引用
收藏
页码:2305 / 2316
页数:12
相关论文
共 50 条
  • [1] Lattice-based public-key encryption with conjunctive keyword search in multi-user setting for IIoT
    Yongli Tang
    Yanpeng Ba
    Lixiang Li
    Xiaojun Wang
    Xixi Yan
    [J]. Cluster Computing, 2022, 25 : 2305 - 2316
  • [2] Verifiable Public Key Encryption With Keyword Search Based on Homomorphic Encryption in Multi-User Setting
    Wu, D. N.
    Gan, Q. Q.
    Wang, X. M.
    [J]. IEEE ACCESS, 2018, 6 : 42445 - 42453
  • [3] Public key encryption with conjunctive keyword search and its extension to a multi-user system
    Hwang, Yong Ho
    Lee, Pil Joong
    [J]. PAIRING-BASED CRYPTOGRAPHY - PAIRING 2007, 2007, 4575 : 2 - +
  • [4] Public-Key Encryption with Keyword Search in Multi-user, Multi-challenge Setting under Adaptive Corruptions
    Ling, Yunhao
    Zhang, Kai
    Chen, Jie
    Huang, Qiong
    Qian, Haifeng
    [J]. PUBLIC-KEY CRYPTOGRAPHY, PT IV, PKC 2024, 2024, 14604 : 105 - 126
  • [5] Multi-user certificateless public key encryption with conjunctive keyword search for cloud-based telemedicine
    Ma, Mimi
    Fan, Shuqin
    Feng, Dengguo
    [J]. JOURNAL OF INFORMATION SECURITY AND APPLICATIONS, 2020, 55 (55)
  • [6] A lattice-based designated-server public-key authenticated encryption with keyword search
    Fan, Yajun
    Qin, Baodong
    Zheng, Dong
    [J]. JOURNAL OF SYSTEMS ARCHITECTURE, 2023, 145
  • [7] Public key encryption with conjunctive keyword search on lattice
    Wang, Peng
    Xiang, Tao
    Li, Xiaoguo
    Xiang, Hong
    [J]. JOURNAL OF INFORMATION SECURITY AND APPLICATIONS, 2020, 51
  • [8] Public-Key Encryption with Keyword Search from Lattice
    Hou, Changjiang
    Liu, Fei
    Bai, Hongtao
    Ren, Lanfang
    [J]. 2013 EIGHTH INTERNATIONAL CONFERENCE ON P2P, PARALLEL, GRID, CLOUD AND INTERNET COMPUTING (3PGCIC 2013), 2013, : 336 - 339
  • [9] Provably secure public-key encryption with conjunctive and subset keyword search
    Oriol Farràs
    Jordi Ribes-González
    [J]. International Journal of Information Security, 2019, 18 : 533 - 548
  • [10] Forward Secure Public-key Authenticated Encryption with Conjunctive Keyword Search
    JIANG, Z. H. E.
    ZHANG, K. A., I
    WANG, L. I. A. N. G. L. I. A. N. G.
    NING, J. I. A. N. T. I. N. G.
    [J]. COMPUTER JOURNAL, 2023, 66 (09): : 2265 - 2278