Practical identity-based encryption without random oracles

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4004 LNCS, Issue , 2006, Pages 445-464

  Gentry, Craig ^a  

^a STANFORD UNIVERSITY   (United States)

Author keywords

Identity Based Encryption

Indexed keywords

BROADCASTING; COMPUTER PROGRAMMING LANGUAGES; ELECTRONIC DOCUMENT IDENTIFICATION SYSTEMS; PROBLEM SOLVING; QUERY LANGUAGES; SECURITY OF DATA;

BILINEAR DIFFIE-HELLMAN EXPONENT ASSUMPTION; BROADCAST ENCRYPTION SYSTEMS; IDENTITY BASED ENCRYPTION; RANDOM ORACLES;

CRYPTOGRAPHY;

EID: 33746062799     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11761679_27     Document Type: Conference Paper

References (27)

1. M. Abdalla, M. Bellare, D. Catalano, E. Kiltz, T. Kohno, T. Lange, J. Malone-Lee, G. Neven, P. Paillier, and H. Shi. Searchable Encryption Revisited: Consistency Properties, Relation to Anonymous IBE, and Extensions. In Advances in Cryptology - Crypto 2005, volume 3621 of LNCS, pages 205-222. Springer-Verlag, 2005.
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. Cryptology ePrint Archive 2005/320.
3. M. Bellare and P. Rogaway. Random Oracles are Practical: A Paradigm for Designing Efficient Protocols. In Proc. of ACM CCS, pages 62-73, 1993.
4. D. Boneh and X. Boyen. Efficient Selective-ID Identity Based Encryption without Random Oracles. In Advances in Cryptology - Eurocrypt 2004, volume 3027 of LNCS, pages 223-238. Springer-Verlag, 2004.
5. D. Boneh and X. Boyen. Secure Identity Based Encryption without Random Oracles. In Advances in Cryptology - Crypto 2004, volume 3152 of LNCS, pages 443-459. Springer-Verlag, 2004.
6. D. Boneh, X. Boyen, and E.-J. Goh. Hierarchical Identity Based Encryption with Constant Size Ciphertext. In Advances in Cryptology - Eurocrypt 2005, volume 3494 of LNCS, pages 440-456. Springer-Verlag, 2005.
7. D. Boneh, G. Di Crescenzo, R. Ostrovsky, and G. Persiano. Public Key Encryption with Keyword Search. In Advances in Cryptology - Eurocrypt 2004, volume 3027 of LNCS, pages 506-522. Springer-Verlag, 2004.
8. D. Boneh and M. Franklin. Identity Based Encryption from the Weil pairing. In Advances in Cryptology - Crypto 2001, volume 2139 of LNCS, pages 213-229. Springer-Verlag, 2001.
9. D. Boneh and M. Franklin. Identity Based Encryption from the Weil pairing. SIAM Journal of Computing, 32(3):586-615, 2003.
10. D. Boneh, C. Gentry, and B. Waters. Collusion-Resistant Broadcast Encryption with Short Ciphertexts and Private Keys. In Advances in Cryptology - Crypto 2005, volume 3621 of LNCS, pages 258-275. Springer-Verlag, 2005.
11. D. Boneh and J. Katz. Improved Efficiency for CCA-Secure Cryptosystems Built Using Identity Based Encryption. In Proc. of CT-RSA, volume 3376 of LNCS, pages 87-103. Springer-Verlag, 2005.
12. D. Boneh, B. Lynn, and H. Shacham, Short signatures from the Weil pairing, Advances in Cryptology - Asiacrypt 2001, Lecture Notes in Computer Science 2248 (2001), Springer, 514-532.
13. X. Boyen, Q. Mie and B. Waters, Direct Chosen Ciphertext Security from Identity Based Techniques, In Proc. of ACM CCS, pages 320-329, 2005.
14. X. Boyen and B. Waters. Anonymous Hierarchical Identity-Based Encryption (without Random Oracles). Cryptology ePrint Archive 2006/085.
15. R. Canetti, S. Halevi, and J. Katz. A Forward-Secure Public-Key Encryption Scheme. In Advances in Cryptology - Eurocrypt 2003, volume 2656 of LNCS, pages 255-271. Springer-Verlag, 2003.
16. R. Canetti, S. Halevi, and J. Katz. Chosen-Ciphertext Security from Identity-Based Encryption. In Advances in Cryptology - Eurocrypt 2004, volume 3027 of LNCS, pages 207-222. Springer-Verlag, 2004.
17. R. Cramer and V. Shoup. A Practical Public Key Cryptosystem Provably Secure Against Adaptive Chosen Ciphertext Attacks. In Advances in Cryptology - Crypto 1998, volume 1462 of LNCS, pages 13-25. Springer-Verlag, 1998.
18. R. Cramer and V. Shoup. Signature Schemes Based on the Strong RSA Assumption. In Proc. of ACM CCS, pages 46-51, 1999.
19. Y. Dodis. Efficient Construction of (Distributed) Verifiable Random Functions. In Proc. of Public Key Cryptography, volume 2567 of LNCS, pages 1-17. Springer-Verlag, 2002.
20. Y. Dodis and A. Yampolskiy. A Verifiable Random Function with Short Proofs and Keys. In Proc. of Public Key Cryptography, volume 3386 of LNCS, pages 416-431. Springer-Verlag, 2005.
21. C. Gentry and A. Silverberg. Hierarchical ID-Based Cryptography. In Advances in Cryptology - Asiacrypt 2002, volume 2501 of LNCS, pages 548-566. Springer-Verlag, 2002.
22. J. Horwitz and B. Lynn. Toward Hierarchical Identity-Based Encryption. In Advances in Cryptology - Eurocrypt 2002, volume 2332 of LNCS, pages 466-481. Springer-Verlag, 2002.
23. J. Katz and N. Wang. Efficiency Improvements for Signature Schemes with Tight Security Reductions. In Proc. of ACM CCS, pages 155-164, 2003.
24. K. Kurosawa and Y. Desmedt. A New Paradigm of Hybrid Encryption Scheme. In Advances in Cryptology - Crypto 2004, volume 3152 of LNCS, pages 426-442. Springer-Verlag, 2004.
25. A. Shamir. Identity-Based Cryptosystems and Signature Schemes. In Advances in Cryptology - Crypto 1984, volume 196 of LNCS, pages 47-53. Springer-Verlag, 1984.
26. V. Shoup. Lower Bounds for Discrete Logarithms and Related Problems. In Advances in Cryptology - Eurocrypt 1997, volume 1233 of LNCS, pages 256-266. Springer-Verlag, 1997.
27. B. Waters. Efficient Identity-Based Encryption without Random Oracles. In Advances in Cryptology - Eurocrypt 2005, volume 3494 of LNCS, pages 114-127. Springer-Verlag, 2005.