CCA-Secure Deterministic Identity-Based Encryption Scheme

Meijuan Huang (Shaanxi Normal University, China)

Bo Yang (Shaanxi Normal University, China)

Yi Zhao (University of Surrey, United Kingdom)

Kaitai Liang (University of Surrey, United Kingdom)

Liang Xue (University of Waterloo, Canada)

Xiaoyi Yang (The Hong Kong Polytechnic University, China)

Abstract: Deterministic public-key encryption, encrypting a plaintext into a unique ciphertext without involving any randomness, was introduced by Bellare, Boldyreva, and O'Neill (CRYPTO 2007) as a realistic alternative to some inherent drawbacks in randomized public-key encryption. Bellare, Kiltz, Peikert and Waters (EUROCRYPT 2012) bring deterministic public-key encryption to the identity-based setting, and propose deterministic identity-based encryption scheme (DIBE). Although the construc- tions of chosen plaintext attack (CPA) secure DIBE scheme have been studied intensively, the construction of chosen ciphertext attack (CCA) secure DIBE scheme is still challenging problems. In this paper, we introduce the notion of identity-based all-but-one trapdoor functions (IB-ABO-TDF), which is an extension version of all-but-one lossy trapdoor function in the public-key setting. We give a instantiation of IB-ABO-TDF under decisional linear assumption. Based on an identity-based lossy trapdoor function and our IB-ABO-TDF, we present a generic construction of CCA-secure DIBE scheme.

Keywords: chosen ciphertext security, deterministic identity-based encryption, identity-based all-but-one trapdoor functions, identity-based lossy trapdoor functions

Categories: C.2.0, D.4.6, E.3