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
相关论文
共 59 条
[1]  
Abdalla M, 2005, LECT NOTES COMPUT SC, V3621, P205
[2]  
Arriaga A, 2014, LECT NOTES COMPUT SC, V8469, P31
[3]  
Baek J, 2008, LECT NOTES COMPUT SC, V5072, P1249, DOI 10.1007/978-3-540-69839-5_96
[4]  
BingJian W., 2011, INT J INF ED TECHNOL, V1, P350
[5]  
Boneh D, 2004, LECT NOTES COMPUT SC, V3027, P506
[6]   Identity-based encryption from the Weil pairing [J].
Boneh, D ;
Franklin, M .
SIAM JOURNAL ON COMPUTING, 2003, 32 (03) :586-615
[7]   A Survey of Provably Secure Searchable Encryption [J].
Bosch, Christoph ;
Hartel, Pieter ;
Jonker, Willem ;
Peter, Andreas .
ACM COMPUTING SURVEYS, 2015, 47 (02)
[8]  
Byun JW, 2006, LECT NOTES COMPUT SC, V4165, P75
[9]  
Cai XM, 2011, 2011 INTERNATIONAL CONFERENCE ON ECONOMIC, EDUCATION AND MANAGEMENT (ICEEM2011), VOL II, P90
[10]  
Chen L, 2019, J NEURORESTORATOLOGY, V7, P1, DOI [10.18178/jacn.2019.7.1.263, 10.26599/JNR.2019.9040004]