HIBE With Short Public Parameters Without Random Oracle

  • Sanjit Chatterjee
  • Palash Sarkar
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4284)

Abstract

At Eurocrypt 2005, Waters presented an identity based encryption (IBE) protocol which is secure in the full model without random oracle. In this paper, we extend Waters’ IBE protocol to a hierarchical IBE (HIBE) protocol which is secure in the full model without random oracle. The only previous construction in the same setting is due to Waters. Our construction improves upon Waters’ HIBE by significantly reducing the number of public parameters.

References

  1. 1.
    Barreto, P.S.L.M., Kim, H.Y., Lynn, B., Scott, M.: Efficient Algorithms for Pairing-Based Cryptosystems. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol. 2442, pp. 354–368. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  2. 2.
    Boneh, D., Boyen, X.: Efficient Selective-ID Secure Identity-Based Encryption Without Random Oracles. In: Cachin, Camenisch [7], pp. 223–238Google Scholar
  3. 3.
    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. 4.
    Boneh, D., Boyen, X., Goh, E.-J.: Hierarchical Identity Based Encryption with Constant Size Ciphertext. In: Cramer [10], pp. 440–456; Full version available at Cryptology ePrint Archive; Report 2005/015Google Scholar
  5. 5.
    Boneh, D., Franklin, M.K.: Identity-Based Encryption from the Weil Pairing. SIAM J. Comput. 32(3), 586–615 (2003); Earlier version appeared in the proceedings of CRYPTO 2001 (2001)MATHCrossRefMathSciNetGoogle Scholar
  6. 6.
    Boneh, D., Katz, J.: Improved Efficiency for CCA-Secure Cryptosystems Built Using Identity-Based Encryption. In: Menezes, A. (ed.) CT-RSA 2005. LNCS, vol. 3376, pp. 87–103. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  7. 7.
    Cachin, C., Camenisch, J.L. (eds.): EUROCRYPT 2004. LNCS, vol. 3027. Springer, Heidelberg (2004)MATHGoogle Scholar
  8. 8.
    Canetti, R., Halevi, S., Katz, J.: Chosen-Ciphertext Security from Identity-Based Encryption. In: Cachin, Camenisch [7], pp. 207–222Google Scholar
  9. 9.
    Chatterjee, S., Sarkar, P.: Trading Time for Space: Towards an Efficient IBE Scheme with Short(er) Public Parameters in the Standard Model. In: Won, D.H., Kim, S. (eds.) ICISC 2005. LNCS, vol. 3935, pp. 424–440. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  10. 10.
    Cramer, R.J.F. (ed.): EUROCRYPT 2005. LNCS, vol. 3494. Springer, Heidelberg (2005)MATHGoogle Scholar
  11. 11.
    Galbraith, S.D., Harrison, K., Soldera, D.: Implementing the tate pairing. In: Fieker, C., Kohel, D.R. (eds.) ANTS 2002. LNCS, vol. 2369, pp. 324–337. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  12. 12.
    Galindo, D.: Boneh-Franklin Identity Based Encryption Revisited. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol. 3580, pp. 791–802. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  13. 13.
    Gentry, C., Silverberg, A.: Hierarchical ID-Based Cryptography. In: Zheng, Y. (ed.) ASIACRYPT 2002. LNCS, vol. 2501, pp. 548–566. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  14. 14.
    Horwitz, J., Lynn, B.: Toward Hierarchical Identity-Based Encryption. In: Knudsen, L.R. (ed.) EUROCRYPT 2002. LNCS, vol. 2332, pp. 466–481. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  15. 15.
    Joux, A.: A One Round Protocol for Tripartite Diffie-Hellman. J. Cryptology 17(4), 263–276 (2004); Earlier version appeared in the proceedings of ANTS-IVMATHCrossRefMathSciNetGoogle Scholar
  16. 16.
    Naccache, D.: Secure and Practical Identity-Based Encryption. Cryptology ePrint Archive, Report, 2005/369 (2005), http://eprint.iacr.org/
  17. 17.
    Shamir, A.: Identity-Based Cryptosystems and Signature Schemes. In: Blakely, G.R., Chaum, D. (eds.) CRYPTO 1984. LNCS, vol. 196, pp. 47–53. Springer, Heidelberg (1985)CrossRefGoogle Scholar
  18. 18.
    Shoup, V.: Sequences of Games: a Tool for Taming Complexity in Security Proofs. Cryptology ePrint Archive, Report, 2004/332 (2004), http://eprint.iacr.org/
  19. 19.
    Waters, B.: Efficient Identity-Based Encryption Without Random Oracles. In: Cramer [10], pp. 114–127Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Sanjit Chatterjee
    • 1
  • Palash Sarkar
    • 1
  1. 1.Applied Statistics Unit, Indian Statistical InstituteKolkataIndia

Personalised recommendations