A brief look at pairings based cryptography

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

Volumn , Issue , 2007, Pages 19-26

  Boneh, Dan ^a  

^a STANFORD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRAIC GEOMETRY; ASYMPTOTIC NOTATION; CRYPTOSYSTEMS; EFFICIENT ALGORITHMS; LONG STANDING; NEW GENERATION; OPEN PROBLEMS; POLYNOMIAL-TIME; PUBLIC-KEY CRYPTOGRAPHY;

COMPUTER SCIENCE; FIBER OPTIC CHEMICAL SENSORS; FOUNDATIONS; FUNCTION EVALUATION; GEOMETRY; POLYNOMIAL APPROXIMATION; PUBLIC KEY CRYPTOGRAPHY;

CRYPTOGRAPHY;

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

References (56)

1. Michel Abdalla, Mihir Bellare, Dario Catalano, Eike Kiltz, Tadayoshi Kohno, Tanja Lange, John MaloneLee, Gregory Neven, Pascal Paillier, and Haixia Shi. Searchable encryption revisited: Consistency properties, relation to anonymous IBE, and extensions. In CRYPTO, pages 205-222, 2005.
2. M. Abe, R. Gennaro, K. Kurosawa, and V. Shoup. Tag-kem/dem: A new framework for hybrid encryption and new analysis of kurosawa-desmedt kern. In Proceedings of Eurocrypt '05, LNCS. Springer, 2005.
3. Ben Adida and Douglas Wikstr om. How to shuffle in public. In Proceedings of TCC'07, 2007.
4. G. Ateniese, K. Fu, M. Green, and S. Hohenberger. Improved proxy re-encryption schemes with applications to secure distributed storage. ACM TISSEC, 9(1), 2006. Extended abstract in NDSS '05.
5. Giuseppe Ateniese, Jan Camenisch, Susan Hohenberger, and Breno de Medeiros. Practical group signatures without random oracles. Cryptology ePrint Archive, Report 2005/385, 2005.
6. Dirk Balfanz, Glenn Durfee, Narendar Shankar, Diana Smetters, Jessica Staddon, and Hao-Chi Wong. Secret handshakes from pairing-based key agreements. In proceedings of IEEE Symposium on Security and Privacy, 2003.
7. M. Bellare, C. Namprempre, and G. Neven. Security proofs for identity-based identification and signature schemes. In Proceedings of Eurocrypt '04, 2004.
8. M. Bellare, C. Namprempre, and G. Neven. Unrestricted aggregate signatures. In ICALP '07, 2007.
9. John Bethencourt, Amit Sahai, and Brent Waters. Ciphertext-policy attribute-based encryption. In Proceedings of 2007 IEEE Symposium on Security and Privacy, 2007.
10. Alexandra Boldyreva. Efficient threshold signature, multisignature and blind signature schemes based on the gap-Diffie-Hellman-group signature scheme. In Proceedings of PKC 2003, volume 2567 of LNCS, pages 31-46. Springer-Verlag, 2003.
11. D. Boneh and Xavier Boyen. Efficient selectiveID identity based encryption without random oracles. In Proceedings of Eurocrypt 2004, volume 3027 of LNCS, pages 223-38. Springer, 2004.
12. D. Boneh, Xavier Boyen, and Hovav Shacham. Short group signatures. In Proceedings of Crypto 2004, LNCS, August 2004.
13. D. Boneh, Giovanni Di Crescenzo, Rafial Ostrovsky, and Giuseppe Persiano. Public key encryption with keyword search. In Proceedings of Eurocrypt '04, 2004.
14. D. Boneh and Matt Franklin. Identity-based encryption from the Weil pairing. SIAM Journal of Computing, 32(3):586-615, 2003. extended abstract in Crypto '01.
15. D. Boneh, C. Gentry, and M. Hamburg. Space-efficient identity based encryption without pairings. In FOCS '07, 2007.
16. D. Boneh, Craig Gentry, Ben Lynn, and Hovav Shacham. Aggregate and verifiably encrypted signatures from bilinear maps. In Proceedings of Eurocrypt '03, pages 416-423, 2003.
17. D. Boneh, Craig Gentry, and Brent Waters. Collusion resistant broadcast encryption with short ciphertexts and private keys. In CRYPTO '05, pages 258-275, 2005.
18. D. Boneh, E. Goh, and X. Boyen. Hierarchical identity based encryption with constant size ciphertext. In proceedings of Eurocrypt '05, 2005.
19. D. Boneh, Eu-Jin Goh, and Kobbi Nissim. Evaluating 2-dnf formulas on ciphertexts. In Proceedings of Theory of Cryptography Conference 2005, volume 3378 of LNCS, pages 325-342. Springer, 2005.
20. D. Boneh, Ben Lynn, and Hovav Shacham. Short signatures from the Weil pairing. J. of Cryptology, 17(4):297-319, 2004. Extended abstract in Asiacrypt 2001.
21. D. Boneh, Amit Sahai, and Brent Waters. Fully collusion resistant traitor tracing with short ciphertexts and private keys. In Proceedings of Eurocrypt '06, 2006.
22. X. Boyen, Q. Mei, and B. Waters. Direct chosen ciphertext security from identity-based techniques. In proceedings of ACM CCS'05, pages 320-329, 2005.
23. Xavier Boyen and Brent Waters. Anonymous hierarchical identity-based encryption (without random oracles). In Crypto '06, 2006.
24. Xavier Boyen and Brent Waters. Compact group signatures without random oracles. In Proceeding of Eurocrypt '06, 2006.
25. Jan Camenisch and Anna Lysyanskaya. Signature schemes and anonymous credentials from bilinear maps. In proceedings of Crypto '04, 2004.
26. Ran Canetti, Shai Halevi, and Jonathan Katz. A forward-secure public-key encryption scheme. In Proceedings of Eurocrypt 2003, volume 2656 of LNCS, 2003.
27. Ran Canetti, Shai Halevi, and Jonathan Katz. Chosenciphertext security from identity-based encryption. In Proceedings of Eurocrypt 2004, LNCS, 2004.
28. Clifford 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.
29. Ronald Cramer and Victor Shoup. Signature schemes based on the strong RSA assumption. ACM TISSEC, 3(3): 161-185, 2000. Extended abstract in Proc. 6th ACM CCS, 1999.
30. Giovanni Di Crescenzo and Vishal Saraswat. Searchable public-key encryption based on jacobi symbols, manuscript, Feb. 2007.
31. Yevgeniy Dodis and Aleksandr Yampolskiy. A verifiable random function with short proofs and keys. In Proceedings of PKC'05, 2005.
32. A. Fiat and M. Naor. Broadcast encryption. In Proceedings of Crypto '93, volume 773 of LNCS, pages 480-491. Springer-Verlag, 1993.
33. Rosario Gennaro, Shai Halevi, and Tal Rabin. Secure hash-and-sign signatures without the random oracle. In Proceedings of Eurocrypt 1999, LNCS, pages 123-139. Springer-Verlag, 1999.
34. Craig Gentry. Practical identity-based encryption without random oracles. In Proceedings of Eurocrypt '06, volume 4004 of LNCS, pages 445-464, 2006.
35. Craig Gentry and Alice Silverberg. Hierarchical IDbased cryptography. In Proceedings of Asiacrypt 2002, pages 548-66, 2002.
36. Jens Groth, Rafail Ostrovsky, and Amit Sahai. Noninteractive zaps and new techniques for NIZK. In Proceedings of Crypto '06, 2006.
37. Jens Groth, Rafail Ostrovsky, and Amit Sahai. Perfect non-interactive zero knowledge for NP. In Proceedings of Eurocrypt '06, pages 339-358, 2006.
38. Antoine Joux. A one round protocol for tripartite Diffie-Hellman. J. of Cryptology, 17(4):263-276, 2004. extended abstract in ANTS 2000.
39. Antoine Joux and Kim Nguyen. Separating decision Diffie-Hellman from Diffie-Hellman in cryptographic groups. J. of Cryptology, 16(4):239-247, 2003. extended abstract in ePrint report 2001/003.
40. E. Kiltz, A. Mityagin, S. Panjwani, and B. Raghavan. Append-only signatures. In Proceedings of ICALP '05, pages 434-445, 2005.
41. Eike Kiltz. Chosen-ciphertext security from tag-based encryption. In Proceedings of TCC'06, pages 581-600, 2006.
42. Eyal Kushilevitz and Rafail Ostrovsky. Replication is not needed: Single database, computationally-private information retrieval. In FOCS '97, pages 364-373, 1997.
43. Ninghui Li, Wenliang Du, and D. Boneh. Oblivious signature-based envelope. Distributed Computing, 17(4):293-302, 2005. selected paper from PODC '03.
44. Steve Lu, Rafail Ostrovsky, Amit Sahai, Hovav Shacham, and Brent Waters. Sequential aggregate signatures and multisignatures without random oracles. In Proceeding of Eurocrypt 2006, 2006.
45. Ben Lynn. The pairing-based cryptography (PBC) library, http://crypto.stanford.edu/pbc.
46. A. Lysyanskaya. Unique signatures and verifiable random functions from DH-DDH separation. In Proceedings of Crypto '02, pages 597-612, 2002.
47. U. Maurer. Towards the equivalence of breaking the Diffie-Hellman protocol and computing discrete logarithms. In Proceedings of Crypto'94, pages 271-281, 1994.
48. Alfred Menezes, Tatsuaki Okamoto, and Paul Vanstone. Reducing Elliptic Curve Logarithms to Logarithms in a Finite Field. IEEETIT: IEEE Transactions on Information Theory, 39(5): 1639-1646, 1993.
49. S. Micali, M. Rabin, and S. Vadhan. Verifiable random functions. In Proceedings of FOCS '99, pages 120-130, 1999.
50. Victor Miller. The weil pairing, and its efficient calculation. J. of Cryptology, 17(4):235-261, 2004. extended abstract written in 1986, but never published.
51. D. Naor, M. Naor, and J. Lotspiech. Revocation and tracing schemes for stateless receivers. In Proceedings of Crypto '01, volume 2139 of LNCS, pages 41-62, 2001.
52. R. Rivest, L. Adleman, and M. Dertouzos. On data banks and privacy homomorphisms. Foundations of Secure Computation, 1978.
53. Ryuichi Sakai, Kiyoshi Ohgishi, and Masao Kasahara. Cryptosystems based on pairings. In Proceedings of the Symposium on Cryptography and Information Security-SCIS 2000, Japan, 2000.
54. Adi Shamir. Identity-based cryptosystems and signature schemes. In Advances in Cryptology-CRYPTO 1984, volume 196 of LNCS, pages 47-53. Springer-Verlag, 1984.
55. Joseph H. Silverman. The Arithmetic of Elliptic Curves, volume 106 of Graduate Texts in Mathematics. Springer-Verlag, 1986.
56. Brent Waters. Efficient identity-based encryption without random oracles. In Proceedings of Eurocrypt 2005. Springer, 2005.