Public-Key Encryption from ID-Based Encryption Without One-Time Signature
Design a secure public key encryption scheme and its security proof are one of the main interests in cryptography. In 2004, Canetti, Halevi and Katz  constructed a public key encryption (PKE) from a selective identity-based encryption scheme with a strong one-time signature scheme. In 2005, Boneh and Katz  improved Canetti-Halevi-Katz construction by replacing a strong one-time signature with a message authentication code, but it is not publicly verifiable. Later, Boyen, Mei and Waters  constructed PKE scheme directly from Waters’ IBE scheme  , which is only secure against direct chosen-ciphertext attack and is not secure against adaptive chosen-ciphertext attack. In 2006, Tan  further improved the efficiency of Canetti-Halevi-Katz (CHK) construction by directly from Boneh-Boyen identity based encryption (IBE) scheme  with a weak one-time signature. In this paper, we construct an efficient public key encryption scheme without one-time signature, which preserves a publicly verifiable property and secure against adaptive chosen-ciphertext attack. The construction of the proposed scheme is based on Boneh-Boyen identity-based encryption (IBE) scheme  and a trapdoor function. We also show that the proposed scheme is more efficient than CHK construction.
KeywordsCryptography public key encryption bilinear maps
Unable to display preview. Download preview PDF.
- 1.Boneh, D., Boyen, X.: Secure identity based encryption without random oracles. In: Franklin, M. (ed.) CRYPTO 2004. LNCS, vol. 3152, pp. 443–459. Springer, Heidelberg (2004)Google Scholar
- 4.Boneh, D., Canetti, R., Halevi, S., Katz, J.: Chosen-Ciphertext Security From Identity-Based Encryption. SIAM Journal on Computing (accepted) available from http://www.cs.umd.edu/~jkatz/papers/id-cca-journal/pdf
- 9.Cramer, R., Shoup, V.: A practical public key cryptosystem provably secure against adaptive chosen ciphertext attack. In: Krawczyk, H. (ed.) CRYPTO 1998. LNCS, vol. 1462, pp. 13–25. Springer, Heidelberg (1998)Google Scholar
- 13.MIRACL, Multiprecision integer and rational arithmetic C/C++ library, Shamus Software Ltd., available from http://indigo.ie/~mscott/
- 14.Rackoff, C., Simon, D.: Non-interactive zero-knowledge proof of knowledge and chosen ciphertext attack. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol. 576, pp. 46–64. Springer, Heidelberg (1992)Google Scholar
- 15.Shoup, V.: Sequences of games: a tool for taming complexity in security proofs (manuscript, 2004), available from http://eprint.iacr.org/2004/332