An ElGamal-like Secure Channel Free Public Key Encryption with Keyword Search Scheme

被引:5
作者
Hwang, Min-Shiang [1 ,2 ]
Lee, Cheng-Chi [3 ]
Hsu, Shih-Ting [4 ]
机构
[1] Asia Univ, Dept Comp Sci & Informat Engn, 500 Liufeng Rd, Taichung 402, Taiwan
[2] China Med Univ, Dept Med Res, China Med Univ Hosp, 91 Hsueh Shih Rd, Taichung 40402, Taiwan
[3] Fu Jen Catholic Univ, Dept Lib & Informat Sci, 510 Zhongzheng Rd, New Taipei 24205, Taiwan
[4] Natl Chung Hsing Univ, Dept Management Informat Syst, 250 Kuo Kuang Rd, Taichung 402, Taiwan
关键词
PEKS; off-line keyword guessing attack; ElGamal; encryption; designated tester; GUESSING ATTACKS; RANKED SEARCH; CLOUD DATA; CRYPTOSYSTEM;
D O I
10.1142/S0129054119500047
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
The idea of public key encryption with keyword search (PEKS), proposed by Boneh et al., enables one to send a trapdoor containing a encrypted keyword to query data without revealing the keyword. In Boneh et al.'s design, the trapdoor has to be transferred through a secure channel, which is both costly and inefficient. Baek et al. then proposed an efficient secure channel free public key encryption scheme with keyword search (SCF-PEKS). After that, vast amounts of research have focused on the protection against the off-line keyword guessing attack (OKGA) by enhancing the model. However, most of the PEKS/SCF-PEKS schemes developed so far are constructed by applying bilinear pairing and are susceptible to off-line keyword guessing attacks. In this paper, we propose a new SCF-PEKS scheme based on the ElGamal cryptosystem. The proposed scheme is not only secure against off-line keyword guessing attacks but also improves the efficiency.
引用
收藏
页码:255 / 273
页数:19
相关论文
共 30 条
[1]   Searchable encryption revisited: Consistency properties, relation to anonymous IBE, and extensions [J].
Abdalla, Michel ;
Bellare, Mihir ;
Catalano, Dario ;
Kiltz, Eike ;
Kohno, Tadayoshi ;
Lange, Tanja ;
Malone-Lee, John ;
Neven, Gregory ;
Paillier, Pascal ;
Shi, Haixia .
JOURNAL OF CRYPTOLOGY, 2008, 21 (03) :350-391
[2]  
[Anonymous], 2013, INT J NETWORK SECURI
[3]  
[Anonymous], 2012, J. Wirel. Mob. Netw. Ubiquitous Comput. Dependable Appl.
[4]  
Baek J, 2008, LECT NOTES COMPUT SC, V5072, P1249, DOI 10.1007/978-3-540-69839-5_96
[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]  
Byun JW, 2006, LECT NOTES COMPUT SC, V4165, P75
[8]  
Cai XM, 2011, 2011 INTERNATIONAL CONFERENCE ON ECONOMIC, EDUCATION AND MANAGEMENT (ICEEM2011), VOL II, P90
[9]   The random oracle methodology, revisited [J].
Canetti, R ;
Goldreich, O ;
Halevi, S .
JOURNAL OF THE ACM, 2004, 51 (04) :557-594
[10]   Parallel computation of the generating keys for RSA cryptosystems [J].
Chang, CC ;
Hwang, MS .
ELECTRONICS LETTERS, 1996, 32 (15) :1365-1366