Lattice-Based IBE with Equality Test in Standard Model

被引:24
作者
Dung Hoang Duong [1 ]
Le, Huy Quoc [1 ]
Roy, Partha Sarathi [1 ]
Susilo, Willy [1 ]
机构
[1] Univ Wollongong, Sch Comp & Informat Technol, Inst Cybersecur & Cryptol, Northfields Ave, Wollongong, NSW 2522, Australia
来源
PROVABLE SECURITY, PROVSEC 2019 | 2019年 / 11821卷
基金
澳大利亚研究理事会;
关键词
IDENTITY-BASED ENCRYPTION;
D O I
10.1007/978-3-030-31919-9_2
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Public key encryption with equality test (PKEET) allows the testing of equality of underlying messages of two ciphertexts. PKEET is a potential candidate for many practical applications like efficient data management on encrypted databases. Identity-based encryption scheme with equality test (IBEET), which was introduced by Ma (Information Science 2016), can simplify the certificate management of PKEET. Potential applicability of IBEET leads to intensive research from its first instantiation. Ma's IBEET and most of the constructions are proven secure in the random oracle model based on number-theoretic hardness assumptions which are vulnerable in the post-quantum era. Recently, Lee et al. (ePrint 2016) proposed a generic construction of IBEET schemes in the standard model and hence it is possible to yield the first instantiation of IBEET schemes based on lattices. Their method is to use a 3-level hierarchical identity-based encryption (HIBE) scheme together with a one-time signature scheme. In this paper, we propose, for the first time, a concrete construction of an IBEET scheme based on the hardness assumption of lattices in the standard model and compare the data sizes with the instantiation from Lee et al. (ePrint 2016). Further, we have modified our proposed IBEET to make it secure against insider attack.
引用
收藏
页码:19 / 40
页数:22
相关论文
共 15 条
[11]   Identity-based encryption with outsourced equality test in cloud computing [J].
Ma, Sha .
INFORMATION SCIENCES, 2016, 328 :389-402
[12]   Worst-case to average-case reductions based on Gaussian measures [J].
Micciancio, D ;
Regev, O .
45TH ANNUAL IEEE SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, 2004, :372-381
[13]  
Regev O., 2005, 37 ANN ACM S THEOR C, P1, DOI DOI 10.1145/1060590.1060603
[14]   Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer [J].
Shor, PW .
SIAM REVIEW, 1999, 41 (02) :303-332
[15]   ID-Based Encryption with Equality Test Against Insider Attack [J].
Wu, Tong ;
Ma, Sha ;
Mu, Yi ;
Zeng, Shengke .
INFORMATION SECURITY AND PRIVACY, ACISP 2017, PT I, 2017, 10342 :168-183