The weil and tate pairings as building blocks for public key cryptosystems

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

Volumn 2369, Issue , 2002, Pages 20-32

  Joux, Antoine ^a  

^a DCSSI Crypto Lab 51   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84958550160     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45455-1_3     Document Type: Conference Paper

References (39)

1. L. M. Adleman and M. A. Huang. Function field sieve method for discrete logarithms over finite fields. In Information and Computation, volume 151, pages 5–16. Academic Press, 1999.
2. P. Barreto and H. Kim. Fast hashing onto elliptic curves of fields of characteristic 3. Cryptology eprint Archives http://eprint.iacr.org, 2001. Number 2001/096.
3. P. Barreto, H. Kim, B. Lynn, and M. Scott. Efficient algorithms for pairingbased cryptosystems. Cryptology eprint Archives http://eprint.iacr.org, 2002. Number 2002/008.
4. D. Boneh and M. Franklin. Identity-based encryption from the Weil pairing. In J. Kilian, editor, Proceedings of CRYPTO’2001, volume 2139 of Lecture Notes in Comput. Sci., pages 213–229. Springer, 2001.
5. D. Boneh, B. Lynn, and H. Shacham. Short signatures from the Weilpairing. In C. Boyd, editor, Proceedings of ASIACRYPT’2001, volume 2248 of Lecture Notes in Comput. Sci., pages 514–532. Springer, 2001. Updated version available from the authors.
6. S. Brands. An efficient off–line electronic cash system based on the representation problem. Technical Report CS–R9323, CWI, Amsterdam, 1993.
7. M. Burmester and Y. Desmedt. A secure and efficient conference key distribution system. In A. De Santis, editor, Advances in Cryptology — EUROCRYPT’94, volume 950 of Lecture Notes in Comput. Sci., pages 275–286. Springer, 1995.
8. J. C. Cha and J. H. Cheon. An identity-based signature from gap Diffie–Hellman groups. Cryptology eprint Archives http://eprint.iacr.org, 2002. Number 2002/018.
9. D. Chaum. Zero-knowledge undeniable signatures (extended abstract). In Ivan B. Damg˚ard, editor, Advances in Cryptology - EuroCrypt’90, volume 473 of Lecture Notes in Comput. Sci., pages 458–464, Berlin, 1990. Springer-Verlag.
10. D. Chaum and T. P. Pedersen. Wallet databases with observers. In Ernest F. Brickell, editor, Advances in Cryptology - Crypto’92, volume 740 of Lecture Notes in Comput. Sci., pages 89–105, Berlin, 1992. Springer-Verlag.
11. D. Chaum and H. van Antwerpen. Undeniable signatures. In Gilles Brassard, editor, Advances in Cryptology - Crypto’89, volume 435 of Lecture Notes in Comput. Sci., pages 212–217, Berlin, 1989. Springer-Verlag.
12. Q. Cheng and S. Uchiyama. Nonuniform polynomial time algorithm to solve decisional Diffie–Hellman problem in finite fields under conjecture. In CR-RSA 2002, number 2271 in Lecture Notes in Comput. Sci., pages 290–299. Springer, 2002.
13. Y. Choie, E. Jeong, and E. Lee. Supersingular hyperelliptic curve of genus 2 over finite fields. Cryptology eprint Archives http://eprint.iacr.org, 2002. Number 2002/032.
14. C. Cocks. An identity based encryption scheme based on quadratic residues. Cryptography and Coding, 2001. To appear, preprint available at http://www.cesg.-gov.uk/technology/id-pkc/media/ciren.pdf.
15. G. Frey, M. Müller, and H.-G. Rück. The Tate pairing and the discrete logarithm applied to elliptic curve cryptosystems. IEEE Transactions on Information Theory, 45(5):1717–1718, 1999.
16. S. D. Galbraith. Supersingular curves in cryptography. In C. Boyd, editor, Proceedings of ASIACRYPT’2001, volume 2248 of Lecture Notes in Comput. Sci., pages 495–513. Springer, 2001.
17. S. D. Galbraith, K. Harrison, and D. Soldera. Implementing the Tate pairing. In This Volume, 2002.
18. F. Hess. Exponent groups signature schemes and efficient identity based signature schemes based on pairings. Cryptology eprint Archives http://eprint.iacr.org,2002. Number 2002/012.
19. J. Horwitz and B. Lynn. Toward hierarchicaliden tity-based encryption. To appear at Eurocrypt 2002., May 2002.
20. A. Joux. A one round protocol for tripartite Diffie–Hellman. In Wieb Bosma, editor, Proceedings of the ANTS-IV conference, volume 1838 of Lecture Notes in Comput. Sci., pages 385–394. Springer, 2000.
21. A. Joux and L. Lercier. The function field sieve is quite special. In This Volume, 2002.
22. N. Koblitz. Elliptic curve cryptography: Which curves to use? Transparencies available at http://www.ipam.ucla.edu/publications/cry2002/cry2002 nkoblitz.-pdf, January 2002. Talk given at the IPAM Cryptography Workshop.
23. N. Koblitz and A. Menezes. Obstacles to the torsion-subgroup attack on the decision Diffie–Hellman problem. Technical Report CORR 2002-05, CACR, 2002. Available at http://www.cacr.math.uwaterloo.ca/tech reports.html.
24. A. Lentra and E. Verheul. The XTR public key system. In Mihir Bellare, editor, Proceedings of CRYPTO’2000, volume 1880 of Lecture Notes in Comput. Sci., pages 1–19. Springer, 2000.
25. U. Maurer and S. Wolf. The relationship between breaking the Diffie–Hellman protocoland computing discrete logarithms. SIAM J. Comput., 28(5):1689–1721, 1999.
26. U. M. Maurer and Y. Yacobi. Non-interative public-key cryptography. In Donald W. Davies, editor, Advances in Cryptology - EuroCrypt’91, volume 547 of Lecture Notes in Comput. Sci., pages 498–507, Berlin, 1991. Springer-Verlag.
27. A. Menezes, T. Okamoto, and S. Vanstone. Reducing elliptic curve logarithms to logarithms in a finite field. IEEE Transaction on Information Theory, 39:1639–1646, 1993.
28. V. Miller. Short programs for functions on curves. Unpublished manuscript, 1986.
29. V. Miller. Use of elliptic curves in cryptography. In H. Williams, editor, Advances in Cryptology — CRYPTO’85, volume 218 of Lecture Notes in Comput. Sci., pages 417–428. Springer, 1986.
30. T. Okamoto and D. Pointcheval. The gap problems: a new class of problems for the security of cryptographic primitives. In Public Key Cryptography, PKC 2001, volume 1992 of Lecture Notes in Comput. Sci., pages 104–118. Springer, 2001.
31. K. Paterson. ID–based signatures from pairings on elliptic curves. Cryptology eprint Archives http://eprint.iacr.org, 2002. Number 2002/004.
32. K. Rubin and A. Silverberg. The best and worst of supersingular abelian varieties in cryptology. Cryptology eprint Archives http://eprint.iacr.org, 2002. Number 2002/006.
33. H. G. Rück and K. Nguyen. A comparison of the Weiland Tate pairing. preprint.
34. O. Schirokauer. The specialfunction field sieve. Preprint.
35. I. Semaev. Evaluation of discrete logarithms in a group of p-torsion points of an elliptic curve in characteristic p. Mathematics of Computation, 67:353–356, 1998.
36. A. Shamir. Identity-based cryptosystems and signature schemes. In G. R. Blakley and David Chaum, editors, Advances in Cryptology: Proceedings of Crypto’84, volume 196 of Lecture Notes in Comput. Sci., pages 47–53, Berlin, 1985. Springer-Verlag.
37. N. Smart. The discrete logarithm problem on elliptic curves of trace one. Journal of Cryptology, 12(3):193–196, 1999.
38. E. Verheul. Evidence that XTR is more secure than supersingular elliptic curve cryptosystems. In B. Pfizmann, editor, Proceedings of EUROCRYPT’2001, volume 2045 of Lecture Notes in Comput. Sci., pages 195–210. Springer, 2001.
39. E. Verheul. Self-blindable credential certificates from the Weil pairing. In C. Boyd, editor, Proceedings of ASIACRYPT’2001, volume 2248 of Lecture Notes in Comput. Sci., pages 533–551. Springer, 2001.