Space-efficient identity based encryption without pairings

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn , Issue , 2007, Pages 647-657

  Boneh, Dan ^a   Gentry, Craig ^a   Hamburg, Michael ^a  

^a Stanford University

Author keywords

[No Author keywords available]

Indexed keywords

(E ,2E) THEORY; BILINEAR MAPS; CIPHER TEXTS; CIPHERTEXTS; ELLIPTIC CURVES (EC); ENCRYPTION AND DECRYPTION; IDENTITY BASED ENCRYPTION (IBE); OPEN PROBLEMS; QUADRATIC FORMS; SINGLE ELEMENT;

COMPUTER SCIENCE; FIBER OPTIC CHEMICAL SENSORS; FOUNDATIONS; MAPS; NUMBER THEORY; QUADRATIC PROGRAMMING;

CRYPTOGRAPHY;

EID: 43149116953     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/FOCS.2007.4389533     Document Type: Conference Paper

References (40)

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 CRYPTO, pages 205-222, 2005.
2. D. Balfanz, G. Durfee, N. Shankar, D. Smetters, J. Staddon, and H.-C. Wong. Secret handshakes from pairing-based key agreements. In Proceedings of the IEEE Symposium and Security and Privacy, pages 180-196, 2003.
3. K. Bentahar, P. Farshim, J. Malone-Lee, and N. Smart. Generic constructions of identity-based and certificateless kerns, http://eprint.iacr. org/2005/058.
4. J. Bethencourt, A. Sahai, and B. Waters. Ciphertext-policy attribute-based encryption. In Proceedings of 2007 IEEE Symposium on Security and Privacy, 2007.
5. D. Boneh and X. Boyen. Efficient selective-ID identity based encryption without random oracles. In Proceedings of Eurocrypt 2004, LNCS, pages 223-238. Springer-Verlag, 2004.
6. D. Boneh, R. Canetti, S. Halevi, and J. Katz. Chosen-ciphertext security from identity-based encryption. SIAM J. of Computing (SICOMP), 36(5):915-942, 2006.
7. D. Boneh, G. D. Crescenzo, R. Ostrovsky, and G. Persiano. Public key encryption with keyword search. In Proceedings of Eurocrypt '04, 2004.
8. D. Boneh and M. Franklin. Identity-based encryption from the Weil pairing. SIAM Journal of Computing, 32(3):586-615, 2003.
9. extended abstract in Crypto '01.
10. D. Boneh, C. Gentry, and M. Hamburg. Space-efficient identity based encryption without pairings. ePrint report 2007/177, 2007. http://eprint.iacr. org/2007/177.
11. X. Boyen and B. Waters. Anonymous hierarchical identity-based encryption (without random oracles). In Crypto '06, 2006.
12. R. Canetti, S. Halevi, and J. Katz. A forward-secure public-key encryption scheme. In Proceedings of Eurocrypt 2003, volume 2656 of LNCS. Springer, 2003.
13. R. Canetti, S. Halevi, and J. Katz. Chosen-ciphertext security from identity-based encryption. In Proceedings of Eurocrypt 2004, LNCS, 2004.
14. J. W. S. Cassels. Rational quadratic forms, volume 13 of London Mathematical Society Monographs. Academic Press, 1978.
15. T. Cochrane and P. Woods. Small solutions of the legendre equation. Journal of Number Theory, 70(1):62-66, 1998.
16. C. Cocks. An identity based encryption scheme based on quadratic residues. In Proceedings of the 8th IMA International Conference on Cryptography and Coding, pages 26-8, 2001.
17. J.-S. Coron. Security proof for partial-domain hash signature schemes. In Proceedings of Crypto '02, LNCS, pages 613-626. Springer, 2002.
18. R. Cramer and V Shoup. Universal hash proofs and a paradigm for chosen ciphertext secure public key encryption. In Proceedings of Eurocrypt 2002, 2002.
19. J. Cremona and D. Rusin. Efficient solution of rational conies. Math, of computation, 72(243):1417-1441, 2003.
20. G. D. Crescenzo and V Saraswat. Searchable public-key encryption based on jacobi symbols, manuscript, Feb. 2007.
21. Y. Desmedt and A. Oldyzko. A chosen text attack on the rsa cryptosystem and some discrete logarithm schemes. In Proceedings of Crypto '85, volume 218 of LNCS, pages 516-521. Springer-Verlag, 1985.
22. Y. Dodis and N. Fazio. Public key broadcast encryption for stateless receivers. In Proceedings of the Digital Rights Management Workshop 2002, volume 2696 of LNCS, pages 61-80. Springer, 2002.
23. C. Gentry. How to compress rabin ciphertexts and signatures (and more). In Proceedings of Crypto '04, pages 179-200, 2004.
24. C. Gentry. Practical identity-based encryption without random oracles. In Proceedings of Eurocrypt '06, volume 4004 of LNCS, pages 445-464, 2006.
25. C. Gentry and A. Silverberg. Hierarchical ID-based cryptography. In Proceedings of Asiacrypt 2002, volume 2501 of LNCS, pages 548-66, 2002.
26. O. Goldreich. Modern Cryptography, Probabilistic Proofs and Pseudorandomness. Springer, 1999.
27. L. L. H. Lensta, L. Lensta. Factoring polynomials with rational coefficients. Math. Ann., 261:515-534, 1982.
28. J. Horwitz and B. Lynn. Towards hierarchical identity-based encryption. In Proceedings of Eurocrypt 2002, volume 2332 of LNCS, pages 466-81. Springer, 2002.
29. N. Li, W. Du, and D. Boneh. Oblivious signature-based envelope. In In proceedings of PODC '03, pages 182-189, 2003.
30. K. Mccusker, N.O'Connor, and D. Diamond. Low-energy finite field arithmetic primitives for implementing security in wireless sensor networks. In Proceedings of 2006 conference on Communications, Circuits and Systems, 2006.
31. A. J. Menezes, P. C. Van Oorschot, and S. A. Vanstone. Handbook of Applied Cryptography. CRC Press, 1997.
32. H. Ong, C. P. Schnorr, and A. Shamir. An efficient signature scheme based on quadratic equations. In Proceedings of STOC '84, pages 208-216, 1984.
33. 2 = m(modn). IEEE Transactions on Information Theory, 33(5):702-709, 1987.
34. R. Sakai and M. Kasahara. ID based cryptosystems with pairing over elliptic curve, http://eprint.iacr.org/2003/054, 2003.
35. A. Shamir. Identity-based cryptosystems and signature schemes. In Advances in Cryptology-CRYPTO 1984, volume 196 of LNCS, pages 47-53. Springer-Verlag, 1984.
36. E. Shi, J. Bethencourt, T.-H. H. Chan, D. Song, and A. Perrig. Multi-dimensional range query over encrypted data. In Proceedings of the IEEE Symposium and Security and Privacy, 2007.
37. B. Vallee. Generation of elements with small modular squares and provably fast integer factoring algorithms. Mathematics of Computation, 56(194):823-849, 1991.
38. B. Waters. Efficient identity-based encryption without random oracles. In Proceedings of Eurocrypt 2005, LNCS, 2005.
39. B. Waters, D. Balfanz, G. Durfee, and D. Smetters. Building an encrypted and searchable audit log. In Proceedings of Network and Distributed System Security Symposium (NDSS 2004), 2004.
40. D. Yao, N. Fazio, Y Dodis, and A. Lysyanskaya. ID-based encryption for complex hierarchies with applications to forward security and broadcast encryption. In Proceedings of the ACM Conference on Computer and Communications Security 2004, pages 354-63, 2004.