Trapdoor Privacy in Public Key Encryption With Keyword Search: A Review

被引:3
|
作者
Chan, Koon-Ming [1 ]
Heng, Swee-Huay [1 ]
Yau, Wei-Chuen [2 ]
Tan, Shing-Chiang [1 ]
机构
[1] Multimedia Univ, Fac Informat Sci & Technol, Jalan Ayer Keroh Lama, Melaka 75450, Malaysia
[2] Xiamen Univ Malaysia, Sch Comp & Data Sci, Sepang 43900, Selangor Darul, Malaysia
关键词
Encryption; Public key; Servers; Privacy; Keyword search; Cloud computing; Receivers; PEKS; searchable encryption; trapdoor privacy; keyword privacy; IDENTITY-BASED ENCRYPTION; GUESSING ATTACKS; AUTHENTICATED ENCRYPTION; SECURE; SCHEME; SERVER; EFFICIENT;
D O I
10.1109/ACCESS.2022.3151429
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
The public key encryption with keyword search (PEKS) scheme allows searches to be performed over ciphertext by a server in a public-key setting. The PEKS scheme suffers from a major drawback which is keyword guessing attack. A keyword guessing attack (KGA) allows the attacker to successfully guess the correct keyword encrypted in a searchable ciphertext and trapdoor. To overcome this vulnerability, security notions, such as keyword privacy and trapdoor privacy were introduced. Keyword privacy prevents any information leaked from the keyword itself, and similarly trapdoor privacy prevents any information leaked from the trapdoor side. A PEKS scheme that is secure against KGA should satisfy trapdoor privacy. In this paper, we compare various types of PEKS schemes in terms of their underlying computational hardness, system model, search function, security properties of keyword privacy and trapdoor privacy, and security against offline KGA and online KGA. From the comparison analysis, we highlight that trapdoor privacy and keyword privacy are essential for a PEKS scheme to be secure against KGA. Lastly, we draw some potential research directions.
引用
收藏
页码:21584 / 21598
页数:15
相关论文
共 50 条
  • [1] Public-Key Authenticated Encryption With Keyword Search Supporting Constant Trapdoor Generation and Fast Search
    Li, Hongbo
    Huang, Qiong
    Huang, Jianye
    Susilo, Willy
    IEEE TRANSACTIONS ON INFORMATION FORENSICS AND SECURITY, 2023, 18 : 396 - 410
  • [2] Public key encryption with keyword search
    Boneh, D
    Di Crescenzo, G
    Ostrovsky, R
    Persiano, G
    ADVANCES IN CRYPTOLOGY - EUROCRYPT 2004, PROCEEDINGS, 2004, 3027 : 506 - 522
  • [3] Combining Public Key Encryption with Keyword Search and Public Key Encryption
    Zhang, Rui
    Imai, Hideki
    IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2009, E92D (05) : 888 - 896
  • [4] PEKSrand: Providing Predicate Privacy in Public-key Encryption with Keyword Search
    Zhu, Benwen
    Zhu, Bo
    Ren, Kui
    2011 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS (ICC), 2011,
  • [5] Generic combination of public key encryption with keyword search and public key encryption
    Zhang, Rui
    Imai, Hideki
    CRYPTOLOGY AND NETWORK SECURITY, 2007, 4856 : 159 - 174
  • [6] On the integration of public key data encryption and public key encryption with keyword search
    Baek, Joonsang
    Safavi-Naini, Reihaneh
    Susilo, Willy
    INFORMATION SECURITY, PROCEEDINGS, 2006, 4176 : 217 - 232
  • [7] The Public Verifiability of Public Key Encryption with Keyword Search
    Zhu, Binrui
    Sun, Jiameng
    Qin, Jing
    Ma, Jixin
    MOBILE NETWORKS AND MANAGEMENT (MONAMI 2017), 2018, 235 : 299 - 312
  • [8] Public key encryption with keyword search revisited
    Baek, Joonsang
    Safavi-Naini, Reihaneh
    Susilo, Willy
    COMPUTATIONAL SCIENCE AND ITS APPLICATIONS - ICCSA 2008, PT 1, PROCEEDINGS, 2008, 5072 : 1249 - 1259
  • [9] Public Key Encryption with Wildcards Keyword Search
    Wang, Zhao-li
    Han, Jin-li
    Wang, Mei-juan
    Shi, Ya-qing
    Dong, Hui
    2018 EIGHTH INTERNATIONAL CONFERENCE ON INSTRUMENTATION AND MEASUREMENT, COMPUTER, COMMUNICATION AND CONTROL (IMCCC 2018), 2018, : 538 - 541
  • [10] Public key encryption with distributed keyword search
    Eslami, Ziba
    Noroozi, Mahnaz
    Amirizirtol, Kobra
    JOURNAL OF DISCRETE MATHEMATICAL SCIENCES & CRYPTOGRAPHY, 2022, 25 (08): : 2369 - 2393