Copyright © 2008 The Institute of Electronics, Information and Communication Engineers
Regular Section -- Papers -- Cryptography and Information Security |
Identity-Based Encryptions with Tight Security Reductions to the BDH Problem
1 The author is with the Systems Lab, HITACHI Ltd., Kawasaki-shi, 215-0013 Japan. E-mail: mototsugu.nishioka.rc{at}hitachi.com
We present IND-ID-CPA secure identity-based encryption (IBE) schemes with tight reductions to the bilinear Diffie-Hellman (BDH) problem. Since the methods for obtaining IND-ID-CCA secure schemes from IND-ID-CPA secure schemes with tight reductions are already known, we can consequently obtain IND-ID-CCA secure schemes with tight reductions to the BDH problem. Our constructions are based on IBE schemes with tight reductions to the list bilinear Diffie-Hellman (LBDH) problem, and the schemes are converted to those with tight reductions to the BDH problem. Interestingly, it can be shown that there exists a black box construction, in which the former IBE schemes are given as black boxes. Our constructions are very simple and reasonably efficient.
Key Words: identity-based encryption, security reduction, bilinear Diffie-Hellman problem
Manuscript received May 18, 2007. Manuscript revised October 23, 2007.
References
[1] S. AlRiyami and K.G. Paterson, "Certificateless public key cryptography," Advances in Cryptology — Asiacrypt 2003, LNCS 2894, pp.452–473, Springer-Verlag, 2003. [2] N. Attrapadung, B. Chevallier-Mames, J. Furukawa, T. Gomi, G. Hanaoka, H. Imai, and R. Zhang, "Efficient identity-based encryption with tight security reduction," IACR Cryptology ePrint Archive, Report 2005/320. Available from http://eprint.iacr.org/2005/320/, 2005. [3] M. Bellare, A. Boldyreva, and A. Palacio, "An uninstantiable random-oracle-model scheme for a hybrid-encryption problem," Advances in Cryptology — Eurocrypt 2004, LNCS 3027, pp.171–188, Springer-Verlag, 2004. [4] D. Boneh and X. Boyen, "Efficient selective-ID secure identity based encryption without random oracles," Advances in Cryptology — Eurocrypt 2004, LNCS 3027, pp.223–238 Springer-Verlag, 2004. [5] D. Boneh and X. Boyen, "Secure identity based encryption without random oracles," Advances in Cryptology — Crypto 2004, LNCS 3152, pp.443–459, Springer-Verlag, 2004. [6] D. Boneh, X. Boyen, and E.-J. Goh, "Hierarchical identity based encryption with constant size ciphertext," Advances in Cryptology — Eurocrypt 2005, LNCS 3493, pp.440–456, Springer-Verlag, 2005. [7] D. Boneh and M. Franklin, "Identity-based encryption from the Weil pairing," Advances in Cryptology — Crypto 2001, LNCS 2139, pp.213–229, Springer-Verlag, 2001. [8] R. Canetti, O. Goldreich, and S. Halevi, "The random oracle methodology, revisited," Proc. 30th ACM STOC'98, pp.209–218, 1998. [9] Z. Cheng and R. Comley, "Efficient certificateless public key encryption," IACR Cryptology ePrint Archive, 2005/012. Available from http://eprint.iacr.org/2005/012, 2005. [10] B. Chevallier-Mames, "An efficient CDH-based signature scheme with a tight security reduction," Advances in Cryptology — Crypto 2005, LNCS 3621, pp.511–526, Springer-Verlag, 2005. [11] H. Cohen, A. Miyaji, and T. Ono, "Efficient elliptic curve exponentiation using mixed coordinates," Advances in Cryptology — Asiacrypt'98, LNCS 1514, pp.51–65, Springer-Verlag, 1998. [12] E. Fujisaki and T. Okamoto, "How to enhance the security of public-key encryption at minimum cost," Public Key Cryptography, LNCS 1560, pp.53–68, Springer-Verlag, 1999. [13] E. Fujisaki and T. Okamoto, "Secure integration of asymmetric and symmetric encryption schemes," Advances in Cryptology — Crypto'99, LNCS 1666, pp.537–554, Springer-Verlag, 1999. [14] C. Gentry, "Practical identity-based encryption without random oracles," Advances in Cryptology — Eurocrypt 2006, LNCS 4004, pp.445–464, Springer-Verlag, 2006. [15] C. Gentry and A. Silverberg, "Hierarchical ID-based cryptography," Advances in Cryptology — Asiacrypt 2002, LNCS 2501, pp.548–566, Springer-Verlag, 2002. [16] J. Horwitz and B. Lynn, "Toward hierarchical identity-based encryption," Advances in Cryptology — Eurocrypt 2002, LNCS 2332, pp.466–481, Springer-Verlag, 2002. [17] J. Katz and N. Wang, "Efficiency improvements for signature schemes with tight security reductions," Proc. ACM-CCS'03, pp.155–164, 2003. [18] K. Kurosawa and T. Takagi, "Some RSA-based encryption schemes with tight security reduction," Advances in Cryptology — Asiacrypt 2003, LNCS 2894, pp.19–36, Springer-Verlag, 2003. [19] Y-R. Lee and H-S. Lee, "An authenticated certificateless public key encryption scheme," IACR Cryptology ePrint Archive, Report 2004/150. Available from http://eprint.iacr.org/2004/150, 2004. [20] M. Nishioka, "Reconsideration on the security of the Boneh-Franklin identity-based encryption scheme," Proc. Indocrypt 2005, LNCS 3797, pp.270–282, Springer-Verlag, 2005. [21] M. Scott, "Faster pairings using an elliptic curve with an efficient endomorphism," Proc. Indocrypt 2005, LNCS 3797, pp.258–269, Springer-Verlag, 2005. [22] A. Shamir, "Identity-based cryptosystems and signature schemes," Advances in Cryptology — Crypto'84, LNCS 196, pp.47–53, Springer-Verlag, 1984. [23] V. Shoup, "Lower bounds for discrete logarithms and related problems," Advances in Cryptology — Eurocrypt'97, LNCS 1233, pp.256–266, Springer-Verlag, 1997. [24] B. Waters, "Efficient identity-based encryption without random oracles," Advances in Cryptology — Eurocrypt 2005, LNCS 3494, pp.114–127, Springer-Verlag, 2005.
CiteULike 
Connotea 
Del.icio.us What's this?
This Article 
Abstract
Full Text (PDF)
Alert me when this article is cited
Alert me if a correction is posted
Services
Email this article to a friend
Similar articles in this journal
Alert me to new issues of the journal
Add to My Personal Archive
Download to citation manager
Request Permissions
Google Scholar
Articles by NISHIOKA, M.
Social Bookmarking
What's this?