Abstract
In this paper, we first review the existing proofs of the Boneh-Franklin identity-based encryption scheme (BF-IBE for short), and show how to admit a new proof by slightly modifying the specifications of the hash functions of the original BF-IBE. Compared with prior proofs, our new proof provides a tighter security reduction and minimizes the use of random oracles, thus indicates BF-IBE has better provable security with our new choices of hash functions. The techniques developed in our proof can also be applied to improving security analysis of some other IBE schemes. As an independent technical contribution, we also give a rigorous proof of the Fujisaki-Okamoto (FO) transformation in the case of CPA-to-CCA, which demonstrates the efficiency of the FO-transformation (CPA-to-CCA), in terms of the tightness of security reduction, has long been underestimated. This result can remarkably benefit the security proofs of encryption schemes using the FO-transformation for CPA-to-CCA enhancement.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Abdalla M, Bellare M, Catalano D, et al. Searchable encryption revisited: Consistency properties, relation to anonymous ibe, and extensions. In: Lecture Notes in Computer Science, vol. 3621. Berlin: Springer, 2005, 205–222
Bellare M, Ristenpart T. Simulation without the artificial abort: Simplified proof and improved concrete security for waters’ IBE scheme. In: Lecture Notes in Computer Science, vol. 5479. Berlin: Springer, 2009, 407–424
Bellare M, Rogaway P. Random oracles are practical: A paradigm for designing efficient protocols. In: Proceeding CCS’93 Proceedings of the 1st ACM conference on Computer and communications security. New York: Association for Computing Machinery, 1993 62–73
Bellare M, Rogaway P. The exact security of digital signatures — how to sign with RSA and rabin. In: Lecture Notes in Computer Science, vol. 1070. Berlin: Springer, 1996, 399–416
Bellare M, Rogaway P. Minimizing the use of random oracles in authenticated encryption schemes. In: Lecture Notes in Computer Science, vol. 1334. London: Springer-Verlag, 1997, 1–16
Boneh D, Franklin M. Identity-based encryption from the weil pairing. In: Lecture Notes in Computer Science, vol. 2139. Berlin: Springer, 2001, 213–229
Boneh D, Franklin M. Identity-based encryption from the weil pairing. SIAM J Comput, 2003, 32: 586–615
Boyen X. Multipurpose identity-based signcryption-a swiss army knife for identity-based cryptography. In: Lecture Notes in Computer Science, vol. 2729. Berlin: Springer, 2003, 383–399
Carter L, Wegman M N. Universal classes of hash functions. J Comput Syst Sci, 1979, 18: 143–154
Chen L, Cheng Z H. Security proof of sakai-kasahara’s identity-based encryption scheme. In: Lecture Notes in Computer Science, vol. 3796. Berlin: Springer, 2005, 442–459
Chen L, Cheng Z H, Malone-Lee J, et al. Efficient ID-KEM based on the Sakai-Kasahara key construction. IEEE Comput Soc, 2006, 153: 19–26
Coron J S. On the exact security of full domain hash. In: Lecture Notes in Computer Science, vol. 1880. Berlin: Springer, 2000, 229–235
Dodis Y, Ostrovsky R, Reyzin L, et al. Fuzzy extractors: How to generate strong keys from biometrics and other noisy data. SIAM J Comput, 2008, 38: 97–139
ElGamal T. A public key cryptosystem and a signature scheme based on discrete logarithms. IEEE Trans Inf Theory, 1985, 31: 469–472
Fischlin M, Lehmann A, Ristenpart T, et al. Random oracles with (out) programmability. In: Lecture Notes in Computer Science, vol. 6477. Berlin: Springer, 2010, 303–320
Fujisaki E, Okamoto T. Secure integration of asymmetric and symmetric encryption schemes. In: Lecture Notes in Computer Science, vol. 1666. Berlin: Springer, 1999, 537–554
Galindo D. Boneh-franklin identity based encryption revisited. In: Lecture Notes in Computer Science, vol. 3580. Berlin: Springer, 2005, 791–802
Gentry C. Certificate-based encryption and the certificate revocation problem. In: Lecture Notes in Computer Science, vol. 2656. Berlin: Springer, 2003, 272–293
Gentry C, Silverberg A. Hierarchical id-based cryptography. In: Lecture Notes in Computer Science, vol. 2501. Berlin: Springer, 2002, 548–566
Horwitz J, Lynn B. Toward hierarchical identity-based encryption. In: Lecture Notes in Computer Science, vol. 2322. Berlin: Springer, 2002, 466–481
Joux A. A one round protocol for triparitite diffie-hellman. In: Lecture Notes in Computer Science, vol. 1838. Berlin: Springer, 2000, 385–394
Nishioka M. Reconsideration on the security of the boneh-franklin identity-based encryption scheme. In: Lecture Notes in Computer Science, vol. 3797. Berlin: Springer, 270–282, 2005
Shamir A. Identity-based cryptosystems and signatures schemes. In: Lecture Notes in Computer Science, vol. 196. Berlin: Springer, 1984, 47–53
Waters B. Dual system encryption: Realizing fully secure ibe and hibe under simple assumptions. In: Lecture Notes in Computer Science, vol. 5677. Berlin: Springer, 2009, 619–636
Zhang R, Imai H. Improvements on security proofs of some identity based encryption schemes. In: Lecture Notes in Computer Science, vol. 3822. Berlin: Springer, 2005, 28–41
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Chen, Y., Chen, L. & Lin, D. Reflections on the security proofs of Boneh-Franklin identity-based encryption scheme. Sci. China Math. 56, 1385–1401 (2013). https://doi.org/10.1007/s11425-013-4673-2
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11425-013-4673-2