Public key encryption with equality test in the standard model

被引:51
作者
Lee, Hyung Tae [1 ]
Ling, San [2 ]
Seo, Jae Hong [3 ,4 ]
Wang, Huaxiong [2 ]
Youn, Taek-Young [5 ]
机构
[1] Jeonbuk Natl Univ, Div Comp Sci & Engn, Coll Engn, Jeonju, South Korea
[2] Nanyang Technol Univ, Sch Phys & Math Sci, Div Math Sci, Singapore, Singapore
[3] Hanyang Univ, Dept Math, Seoul 04763, South Korea
[4] Hanyang Univ, Res Inst Nat Sci, Seoul 04763, South Korea
[5] Elect & Telecommun Res Inst, Gwangju, South Korea
基金
新加坡国家研究基金会;
关键词
Public key encryption with equality test; Identity-based encryption with equality test; Standard model; IDENTITY-BASED ENCRYPTION; STRONGLY UNFORGEABLE SIGNATURES; GENERIC CONSTRUCTION;
D O I
10.1016/j.ins.2019.12.023
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Public key encryption with equality test (PKEET) is a cryptosystem that allows a tester who has trapdoors issued by one or more users U-i to perform equality tests on ciphertexts encrypted using public key(s) of U-i. Since this feature has a lot of practical applications including search on encrypted data, several PKEET schemes have been proposed so far. However, to the best of our knowledge, all the existing proposals are proven secure only under the hardness of number-theoretic problems and/or the random oracle heuristics. In this paper, we show that this primitive can be achieved not only generically from well-established other primitives but also even without relying on the random oracle heuristics. More precisely, our generic construction for PKEET employs a two-level hierarchical identity-based encryption scheme, which is selectively secure against chosen plaintext at-tacks, a strongly unforgeable one-time signature scheme and a cryptographic hash function. Our generic approach toward PKEET has several advantages over all the previous works; it directly leads the first standard model construction and also directly implies the first lattice-based construction. Finally, we show how to extend our approach to the identity-based setting. (C) 2019 Elsevier Inc. All rights reserved.
引用
收藏
页码:89 / 108
页数:20
相关论文
共 28 条
[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]  
Agrawal S, 2010, LECT NOTES COMPUT SC, V6223, P98, DOI 10.1007/978-3-642-14623-7_6
[3]  
Agrawal S, 2010, LECT NOTES COMPUT SC, V6110, P553
[4]  
[Anonymous], 2016, IACR CRYPTOL EPRINT
[5]  
Bellare M, 2007, LECT NOTES COMPUT SC, V4622, P535
[6]  
Boneh D, 2004, LECT NOTES COMPUT SC, V3027, P506
[7]  
Boneh D, 2004, LECT NOTES COMPUT SC, V3027, P223
[8]  
Boneh D, 2006, LECT NOTES COMPUT SC, V3958, P229
[9]  
Canetti R., 1998, Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing, P209, DOI 10.1145/276698.276741
[10]   Chosen-ciphertext security from identity-based encryption [J].
Canetti, R ;
Halevi, S ;
Katz, J .
ADVANCES IN CRYPTOLOGY - EUROCRYPT 2004, PROCEEDINGS, 2004, 3027 :207-222