Title

Jhanwar-Barua’s identity-based encryption revisited

RIS ID

91676

Publication Details

Elashry, I., Mu, Y. & Susilo, W. (2014). Jhanwar-Barua’s identity-based encryption revisited. Lecture Notes in Computer Science, 8792 271-284.

Abstract

In FOCS'07, Boneh, Gentry and Hamburg presented an identity- based encryption (IBE) system (BasicIBE) based on the quadratic resid- uosity (QR) assumption. A BasicIBE encryption of an l-bit message has a short ciphertext of log2 N + 2l bits where N is an RSA composite. However, it is not time-efficient due to solving l + 1 equations in the form Rx2 + Sy2 =1 (mod N). Jhanwar and Barua presented a variant of BasicIBE in which the encryptor only solves 2 (tick)l such equations. In additionm the decryption key is decreased to only one element in ZN. However, the ciphertext size increases from a singel element to 2 (tick)l elements in ZN. In this paper, we revisit the Jhanwar-Barua (JB) system and review its security. We prove that this system is not IND-ID-CPA secure and present a solution to the security flaw of this system. We also point out a flaw in the security proof of the JB system and propose two different security proofs for the fixed system. We prove that it has the same security as the original BasicIBE system.

Please refer to publisher version or contact your library.

Share

COinS
 

Link to publisher version (DOI)

http://dx.doi.org/10.1007/978-3-319-11698-3_21