Chosen Ciphertext Security from Identity-Based Encryption Without Strong Condition
Recently, Canetti et al  gave a generic construction (called CHK construction) of public key encryption (PKE) from a selective identity-based encryption scheme combined with a strong one-time signature scheme. Later, few schemes were proposed to improve the efficiency of CHK construction , for example, Boneh-Katz scheme  replaced a strong one-time signature with a message authentication code and Boyen-Mei-Waters scheme  was constructed directly from Waters’ IBE scheme. But, both constructions have either trade-off the publicly verifiable property or security against adaptive chosen-ciphertext attack. We ask a question whether it is possible to construct an efficient and publicly verifiable PKE scheme from a selective IBE scheme with a weak one-time signature scheme. In this paper, we provide an affirmative answer and construct a public key encryption scheme which preserves the publicly verifiable property and is secure against adaptive chosen-ciphertext attack. The construction of the proposed scheme is based on Boneh-Boyen identity-based encryption (IBE) scheme  and a weak one-time signature scheme (using Waters’ signature scheme ) built within Boneh-Boyen IBE scheme. In this construction, one-time signature scheme is not required to be strongly existential unforgeable as Waters’ signature scheme is not a strongly existential unforgeability. We also show that the proposed scheme is ”almost” as efficient as the original Boneh-Boyen IBE scheme.
KeywordsCryptography public key encryption bilinear map
Unable to display preview. Download preview PDF.
- 2.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
- 5.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
- 12.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
- 18.MIRACL, Multiprecision integer and rational arithmetic C/C++ library, Shamus Software Ltd., available from: http://indigo.ie/~mscott/
- 19.Naccache, D.: Secure and practical identity-based encryption (2005), available from: http://eprint.iacr.org/2005/369
- 22.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. 433–444. Springer, Heidelberg (1992)Google Scholar
- 23.Shoup, V.: Sequences of games: a tool for taming complexity in security proofs (manuscript, 2004), available from: http://eprint.iacr.org/2004/332