Hierarchical identity based encryption with constant size ciphertext

Lecture Notes in Computer Science

Volumn 3494, Issue , 2005, Pages 440-456

  Boneh, Dan ^a   Boyen, Xavier ^b   Goh, Eu Jin ^a  

^a Stanford University   (United States)

^b Voltage Inc   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS; MATHEMATICAL MODELS; SECURITY OF DATA; TEXT PROCESSING;

CIPHERTEXT; HIERARCHICAL IDENTITY BASED ENCRYPTION (HIBE); PUBLIC KEY BROADCAST SYSTEMS; RANDOM ORACLES;

PUBLIC KEY CRYPTOGRAPHY;

EID: 24944562007     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11426639_26     Document Type: Conference Paper

References (27)

1. D. Boneh and X. Boyen. Efficient selective-ID identity based encryption without random oracles. In C. Cachin and J. Camenisch, editors, Proceedings of Eurocrypt 2004, volume 3027 of LNCS, pages 223-38. Springer, 2004.
2. D. Boneh and X. Boyen. Short signatures without random oracles. In C. Cachin and J. Camenisch, editors, Proceedings of Eurocrypt 2004, volume 3027 of LNCS, pages 56-73. Springer, 2004.
3. D. Boneh, X. Boyen, and E.-J. Goh. Hierarchical identity based encryption with constant size ciphertext. Cryptology ePrint Archive, Report 2005/015, 2005.
4. D. Boneh, X. Boyen, and H. Shacham. Short group signatures. In M. Franklin, editor, Proceedings of Crypto 2004, LNCS, pages 41-55. Springer, 2004.
5. D. Boneh and M. Franklin. Identity-based encryption from the Weil pairing. In J. Kilian, editor, Proceedings of Crypto 2001, volume 2139 of LNCS, pages 213-29. Springer, 2001.
6. D. Boneh, C. Gentry, and B. Waters. Collusion resistant broadcast encryption with short ciphertexts and private keys. Cryptology ePrint Archive, Report 2005/018, 2005.
7. D. Boneh and J. Katz. Improved efficiency for CCA-secure cryptosystems built using identity based encryption. In Proceedings of RSA-CT 2005, 2005.
8. D. Boneh, B. Lynn, and H. Shacham. Short signatures from the Weil pairing. In C. Boyd, editor, Proceedings of Asiacrypt 2001, volume 2248 of LNCS, pages 514-32. Springer, 2001.
9. R. Canetti, S. Halevi, and J. Katz. A forward-secure public-key encryption scheme. In E. Biham, editor, Proceedings of Eurocrypt 2003, volume 2656 of LNCS. Springer, 2003.
10. R. Canetti, S. Halevi, and J. Katz. Chosen-ciphertext security from identity-based encryption. In C. Cachin and J. Camenisch, editors, Proceedings of Eurocrypt 2004, volume 3027 of LNCS, pages 207-22. Springer, 2004.
11. Y. Dodis and N. Fazio. Public key broadcast encryption for stateless receivers. In J. Feigenbaum, editor, Proceedings of the Digital Rights Management Workshop 2002, volume 2696 of LNCS, pages 61-80. Springer, 2002.
12. Y. Dodis and A. Yampolskiy. A verifiable random function with short proofs and keys. In Proceedings of the Workshop on Theory and Practice in Public Key Cryptography 2005, 2005.
13. A. Fiat and M. Naor. Broadcast encryption. In D. Stinson, editor, Proceedings of Crypto 1993, volume 773 of LNCS, pages 480-91. Springer, 1993.
14. C. Gentry and A. Silverberg. Hierarchical ID-based cryptography. In Y. Zheng, editor, Proceedings of Asiacrypt 2002, volume 2501 of LNCS, pages 548-66, 2002.
15. M. Goodrich, J. Sun, and R. Tamassia. Efficient tree-based revocation in groups of low-state devices. In M. Franklin, editor, Proceedings of Crypto 2004, volume 3152 of LNCS, pages 511-27. Springer, 2004.
16. D. Halevy and A. Shamir. The LSD broadcast encryption scheme. In M. Yung, editor, Proceedings of Crypto 2002, volume 2442 of LNCS, pages 47-60, 2002.
17. J. Horwitz and B. Lynn. Towards hierarchical identity-based encryption. In L. Knudsen, editor, Proceedings of Eurocrypt 2002, volume 2332 of LNCS, pages 466-81. Springer, 2002.
18. A. Joux. A one round protocol for tripartite Diffie-Hellman. In W. Bosma, editor, Proceedings of Algorithmic Number Theory Symposium IV, volume 1838 of LNCS, pages 385-94. Springer, 2000.
19. S. Mitsunari, R. Sakai, and M. Kasahara. A new traitor tracing. IEICE Transactions Fundamentals, E85-A(2):481-84, 2002.
20. A. Miyaji, M. Nakabayashi, and S. Takano. New explicit conditions of elliptic curve traces for FR-reduction. IEICE Trans. Fundamentals, E84-A(5):1234-43, 2001.
21. M. C. Mont, K. Harrison, and M. Sadler. The HP time vault service: exploiting IBE for timed release of confidential information. In Proceedings of the International World Wide Web Conference 2003, pages 160-69. ACM, 2003.
22. D. Naor, M. Naor, and J. Lotspiech. Revocation and tracing schemes for stateless receivers. In J. Kilian, editor, Proceedings of Crypto 2001, volume 2139 of LNCS, pages 41-62. Springer, 2001.
23. R. Rivest, A. Shamir, and D. Wagner. Time-lock puzzles and timed-release crypto. Technical Report MIT/LCS/TR-684, MIT Laboratory for Computer Science, 1996.
24. A. Shamir. Identity-based cryptosystems and signature schemes. In G. Blakley and D. Chaum, editors, Proceedings of Crypto 1984, volume 196 of LNCS, pages 47-53. Springer, 1984.
25. V. Shoup. Lower bounds for discrete logarithms and related problems. In W. Fumy, editor, Proceedings of Eurocrypt 1997, volume 1233 of LNCS, pages 256-66. Springer, 1997.
26. B. Waters. Efficient identity-based encryption without random oracles. In R. Cramer, editor, Proceedings of Eurocrypt 2005, LNCS. Springer, 2005.
27. D. Yao, N. Fazio, Y. Dodis, and A. Lysyanskaya. ID-based encryption for complex hierarchies with applications to forward security and broadcast encryption. In B. Pfitzmann, editor, Proceedings of the ACM Conference on Computer and Communications Security 2004, pages 354-63, 2004.