Anonymous hierarchical identity-based encryption (Without random oracles)

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

Volumn 4117 LNCS, Issue , 2006, Pages 290-307

  Boyen, Xavier ^a   Waters, Brent ^b  

^a Voltage Inc   (United States)

^b SRI INTERNATIONAL   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; DATA PRIVACY; DATA STRUCTURES; HIERARCHICAL SYSTEMS; SECURITY OF DATA;

ANONYMOUS HIERARCHICAL IDENTITY; BILINEAR GROUPS; PRIVATE COMMUNICATION;

PUBLIC KEY CRYPTOGRAPHY;

EID: 33749573228     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11818175_17     Document Type: Conference Paper

References (35)

1. Michel Abdalla, Mihir Bellare, Dario Catalane, Eike Kiltz, Tadayoshi Kohno, Tanja Lange, John Malone-Lee, Gregory Neven, Pascal Paillier, and Haixia Shi. Searchable encryption revisited: Consistency properties, relation to anonymous IBE, and extensions. In Advances in Cryptology - CRYPTO 2005, Lecture Notes in Computer Science, pages 205-22. Springer-Verlag, 2005.
2. Paulo S. L. M. Barreto and Michael Naehrig. Pairing-friendly elliptic curves of prime order. Cryptology ePrint Archive, Report 2005/133, 2005. http://eprint.iacr.org/.
3. Paulo S.L.M. Barreto, Hae Y. Kim, Ben Lynn, and Michael Scott. Efficient algorithms for pairing-based cryptoSystems. Cryptology ePrint Archive, Report 2002/008, 2002. http://eprint.iacr.org/.
4. Mihir Bellare, Alexandra Boldyreva, Anand Desai, and David Pointcheval. Keyprivacy in public-key encryption. In Proceedings of ASIACRYPT 2001, Lecture Notes in Computer Science, pages 566-82. Springer-Verlag, 2001.
5. Dan Boneh and Xavier Boyen. Efficient selective-ID secure identity based encryption without random oracles. In Advances in Cryptology-EUROCRYPT 2004, volume 3027 of Lecture Notes in Computer Science, pages 223-38. Springer-Verlag, 2004.
6. Dan Boneh and Xavier Boyen. Secure identity based encryption without random oracles. In Advances in Cryptology-CRYPTO 2004, volume 3152 of Lecture Notes in Computer Science, pages 443-59. Springer-Verlag, 2004.
7. Dan Boneh, Xavier Boyen, and Eu-Jin Goh. Hierarchical identity based encryption with constant size ciphertext. In Advances in Cryptology - EUROCRYPT 2005, volume 3494 of Lecture Notes in Computer Science, pages 440-56. Springer-Verlag, 2005.
8. Dan Boneh, Xavier Boyen, and Hovav Shacham. Short group signatures. In Advances in Cryptology-CRYPTO 2004, volume 3152 of Lecture Notes in Computer Science, pages 41-55. Springer-Verlag, 2004.
9. Dan Boneh, Giovanni Di Crescenzo, Rafail Ostrovsky, and Giuseppe Persiano. Public key encryption with keyword search. In Advances in Cryptology-EUROCRYPT 2004, volume 3027 of Lecture Notes in Computer Science, pages 506-22. Springer-Verlag, 2004.
10. Dan Boneh and Matthew Franklin. Identity-based encryption from the Weil pairing. SIAM Journal of Computing, 32(3):586-615, 2003.
11. Extended abstract in Advances in Cryptology-CRYPTO 2001.
12. Dan Boneh and Jonathan Katz. Improved efficiency for CCA-secure cryptoSystems built using identity based encryption. In Proceedings of CT-RSA 2005, volume 3376 of Lecture Notes in Computer Science. Springer-Verlag, 2005.
13. Xavier Boyen. Multipurpose identity-based signcryption: A Swiss Army knife for identity-based cryptography. In Advances in Cryptology - CRYPTO 2003, volume 2729 of Lecture Notes in Computer Science, pages 383-99. Springer-Verlag, 2003.
14. Xavier Boyen, Qixiang Mei, and Brent Waters. Direct chosen ciphertext security from identity-based techniques. In ACM Conference on Computer and Communications Security-CCS 2005. ACM Press, 2005.
15. Ran Canetti, Shai Halevi, and Jonathan Katz. A forward-secure public-key encryption scheme. In Advances in Cryptology - EUROCRYPT 2003, volume 2656 of Lecture Notes in Computer Science. Springer-Verlag, 2003.
16. Ran Canetti, Shai Halevi, and Jonathan Katz. Chosen-ciphertext security from identity-based encryption. In Advances in Cryptology - EUROCRYPT 2004, volume 3027 of Lecture Notes in Computer Science. Springer-Verlag, 2004.
17. Sanjit Chatterjee and Palash Sarkar. Trading time for space: Towards an efficient IBE scheme with short (er) public parameters in the standard model. In Proceedings of ICISC 2005, 2005.
18. Clifford Cocks. An identity based encryption scheme based on quadratic residues. In Proceedings of the 8th IMA International Conference on Cryptography and Coding, 2001.
19. Darren Davis, Fabian Monrose, and Michael K. Reiter. Time-scoped searching of encrypted audit logs. In Proceedings of ICICS 2004, pages 532-45, 2004.
20. Craig Gentry. Practical identity-based encryption without random oracles. In Advances in Cryptology-EUROCRYPT 2006, Lecture Notes in Computer Science. Springer-Verlag, 2006.
21. Craig Gentry and Alice Silverberg. Hierarchical ID-based cryptography. In Proceedings of ASIACRYPT 2002. Springer-Verlag, 2002.
22. Robert Granger and Nigel P. Smart. On computing products of pairings. Cryptology ePrint Archive, Report 2006/172, 2006. http://eprint.iacr.org/.
23. Jeremy Horwitz and Ben Lynn. Towards hierarchical identity-based encryption. In Advances in Cryptology-EUROCRYPT 2002, Lecture Notes in Computer Science, pages 466-81. Springer-Verlag, 2002.
24. Antoine Joux. A one round protocol for tripartite Diffie-Hellman. Journal of Cryptology, 17(4):263-76, 2004.
25. Extended abstract in Proceedings of ANTS IV, 2000.
26. Alfred Menezes, Tatsuaki Okamoto, and Scott Vanstone. Reducing elliptic curve logarithms in a finite field. IEEE Transactions on Information Theory, 39(5):1639-46, 1993.
27. Victor Miller. The Weil pairing, and its efficient calculation. Journal of Cryptology, 17(4), 2004.
28. David Naccache. Secure and practical identity-based encryption. Cryptology ePrint Archive, Report 2005/369, 2005. http://eprint.iacr.org/.
29. Moni Naor. On cryptographic assumptions and challenges. In Advances in Cryptology-CRYPTO 2003. Springer-Verlag, 2003.
30. Adi Shamir. Identity-based cryptosystems and signature schemes. In Advances in Cryptology - CRYPTO 1984, volume 196 of Lecture Notes in Computer Science, pages 47-53. Springer-Verlag, 1984.
31. Victor Shoup. Lower bounds for discrete logarithms and related problems. In Advances in Cryptology-EUROCRYPT 1997, volume 1233 of Lecture Notes in Computer Science. Springer-Verlag, 1997.
32. Dawn Xiaodong Song, David Wagner, and Adrian Perrig. Practical techniques for searches on encrypted data. In Proceedings of the IEEE Symposium on Security and Privacy-SP 2000. IEEE Computer Society, 2000.
33. Brent Waters. Efficient identity-based encryption without random oracles. In Advances in Cryptology - EUROCRYPT 2005, volume 3494 of Lecture Notes in Computer Science. Springer-Verlag, 2005.
34. Brent Waters, Dirk Balfanz, Glenn Durfee, and Diana Smetters. Building an encrypted and searchable audit log. In Proceedings of NDSS 2004, 2004.
35. Danfeng Yao, Nelly Fazio, Yevgeniy Dodis, and Anna Lysyanskaya. ID-based encryption for complex hierarchies with applications to forward security and broadcast encryption. In A CM Conference on Computer and Communications Security-CCS 2004, pages 354-63, 2004.