Provably secure non-interactive key distribution based on pairings

Discrete Applied Mathematics

Volumn 154, Issue 2, 2006, Pages 270-276

  Dupont, Régis ^a   Enge, Andreas ^a  

^a ECOLE POLYTECHNIQUE   (France)

Author keywords

Identity based cryptography; Key distribution; Non interactive; Pairings; Random oracle model; Security proof

Indexed keywords

COMPUTATIONAL METHODS; POLYNOMIALS; PROBLEM SOLVING; RANDOM PROCESSES;

KEY DISTRIBUTION; NON-INTERACTIVE; PAIRINGS; RANDOM ORACLE MODEL; SECURITY PROOFS;

SECURITY OF DATA;

EID: 29244438183     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dam.2005.03.024     Document Type: Conference Paper

References (25)

1. P. Barreto, B. Lynn, M. Scott, Constructing elliptic curves with prescribed embedding degrees, in: S. Cimato, C. Galdi, G. Persiano (Eds.), Security in Communication Networks - Third International Conference, SCN 2002, Amalfi, Italy, September 2002, Lecture Notes in Computer Science, vol. 2576, Springer, Berlin, 2003, pp. 257-267.
2. D. Boneh, M. Franklin, Identity-based encryption from the Weil pairing, SIAM J. Comput. 32 (3) (2003) 586-615
3. extended abstract in: J. Kilian (Ed.), Advances in Cryptology - Crypto 2001, Lecture Notes in Computer Science, vol. 2139, Springer, Berlin, pp. 514-532.
4. D. Boneh, B. Lynn, H. Shacham, Short signatures from the Weil pairing, in: C. Boyd (Ed.), Advances in Cryptology - ASIACRYPT 2001, Lecture Notes in Computer Science, vol. 2248, Springer, Berlin, 2001, pp. 514-532.
5. X. Boyen, Multipurpose identity-based signcryption: a swiss army knife for identity-based cryptography, in: D. Boneh (Ed.), Advances in Cryptology - CRYPTO 2003, Lecture Notes in Computer Science, vol. 2729, Springer, Berlin, 2003, pp. 383-399.
6. F. Brezing, A. Weng, Elliptic curves suitable for pairing based cryptography, to appear in Designs, Codes and Cryptography (2003).
7. J. Cha, J. Cheon, An identity-based signature from gap Diffie-Hellman groups, in: Y. Desmedt (Ed.), Public Key Cryptography - PKC 2003, 2002, pp. 18-30.
8. R. Dupont, A. Enge, and F. Morain Building curves with arbitrary small MOV degree over finite prime fields J. Cryptology 18 2 2005 79 89
9. G. Frey, and H.-G. Rück A remark concerning m-divisibility and the discrete logarithm in the divisor class group of curves Math. Comp. 62 206 1994 865 874
10. F. Hess, Efficient identity-based signature schemes based on pairings, in: K. Nyberg, H. Heys (Eds.), Selected Areas in Cryptography - 9th Annual International Workshop, SAC 2002, St. Johns, Canada, August 2002, Lecture Notes in Computer Science, vol. 2595, Springer, Berlin, 2003, pp. 310-324.
11. D. Hühnlein, M.J. Jacobson Jr., D. Weber, Towards practical non-interactive public-key cryptosystems using non-maximal imaginary quadratic orders, in: D.R. Stinson, S. Tavares (Eds.), Selected Areas in Cryptography 2000, Lecture Notes in Computer Science, vol. 2012, Springer, Berlin, 2000, pp. 275-287.
12. A. Joux, A one round protocol for tripartite Diffie-Hellman, in: W. Bosma (Ed.), Algorithmic Number Theory - ANTS-IV, Lecture Notes in Computer Science, vol. 1838, Springer, Berlin, 2000, pp. 358-394.
13. D. Kügler, Eine Aufwandsanalyse für identitätsbasierte Kryptosysteme, Diplomarbeit, Technische Universität Darmstadt, Deutschland, available at ftp://ftp.informatik.tu-darmstadt.de/pub/TI/reports/kuegler.IDCS. diplom.ps.gz, 1998.
14. D. Kügler, M. Maurer, A note on the weakness of the Maurer-Yacobi squaring method, Technical Report TI-15/99, Fachbereich Informatik, Technische Universität Darmstadt, available at ftp://ftp.informatik.tu-darmstadt.de/ pub/TI/TR/TI-99-15.weaksquaring.ps.gz, 1999.
15. P. J. Lee, C. H. Lim, Modified Maurer-Yacobi's scheme and its applications, in: J. Seberry, Y. Zheng (Eds.), Advances in Cryptology - AUSCRYPT'92, Lecture Notes in Computer Science, vol. 718, 1992, pp. 308-323.
16. B. Libert, J.-J. Quisquater, Efficient signcryption with key privacy from gap Diffie-Hellman groups, in: F. Bao, R. Deng, J. Zhou (Eds.), Public Key Cryptography - PKC 2004, Lecture Notes in Computer Science, vol. 2947, Springer, Berlin, 2004, pp. 187-200.
17. U. Maurer, Y. Yacobi, Non-interactive public-key cryptography, in: D. Davies (Ed.), Advances in Cryptology - EUROCRYPT '91, Lecture Notes in Computer Science, vol. 547, Springer, Berlin, 1992, pp. 498-507.
18. U. Maurer, and Y. Yacobi A non-interactive public-key distribution system Des. Codes Cryptogr. 9 3 1996 305 316
19. A. Menezes, T. Okamoto, and S.A. Vanstone Reducing elliptic curves logarithms to logarithms in a finite field IEEE Trans. Inform. Theory IT-39 5 1993 1639 1646
20. A. Miyaji, M. Nakabayashi, and S. Takano New explicit conditions of elliptic curve traces for FR-reduction IEICE Trans. Fundamentals E84-A 5 2001 1234 1243
21. K. Paterson ID-based signatures from pairings on elliptic curves Electron. Lett. 38 18 2002 1025 1026
22. R. Sakai, K. Ohgishi, M. Kasahara, Cryptosystems based on pairing, sCIS 2000, The 2000 Symposium on Cryptography and Information Security, Okinawa, Japan, January 26-28 (2000).
23. A. Shamir, Identity-based cryptosystems and signature schemes, in: G. Goos, J. Hartmanis (Eds.), Advances in Cryptology - CRYPTO'84, Lecture Notes in Computer Science, vol. 196, Springer, Berlin, 1985, pp. 47-53.
24. N. Smart An identity-based authenticated key agreement protocol based on the Weil pairing Electron. Lett. 38 2002 630 632
25. E. Verheul, Evidence that XTR is more secure than supersingular elliptic curve cryptosystems, in: B. Pfitzmann (Ed.), Advances in Cryptology - EUROCRYPT 2001, Lecture Notes in Computer Science, vol. 2045, Springer, Berlin, 2001, pp. 195-210.