Deniable authenticated key establishment for Internet Protocols

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

Volumn 3364 LNCS, Issue , 2005, Pages 255-271

  Boyd, Colin ^a   Mao, Wenbo ^b   Paterson, Kenneth G ^c  

^a QUEENSLAND UNIVERSITY OF TECHNOLOGY   (Australia)

^b HEWLETT PACKARD LABORATORIES   (United Kingdom)

^c UNIVERSITY OF LONDON   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

INTERNET; MODULAR CONSTRUCTION; NETWORK PROTOCOLS; SECURITY OF DATA;

ELLIPTIC CURVE PAIRINGS; INTERNET KEY EXCHANGE (IKE); INTERNET PROTOCOLS;

ARTIFICIAL INTELLIGENCE;

EID: 33645662264     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11542322_31     Document Type: Conference Paper

References (36)

1. P. S. L. M. Barreto, H.Y. Kim, B. Lynn, and M. Scott. Efficient algorithms for pairing-based cryptosystems. In Advances in Cryptology - CRYPTO 2002, LNCS. Springer-Verlag, 2002.
2. P.S.L.M. Barreto, B. Lynn, and M. Scott. Constructing elliptic curves with prescribed embedding degrees. In Security in communication networks - SCN'2002, volume 2576 of LNCS, pages 263-273. Springer-Verlag, 2002.
3. M. Bellare, R. Canetti, and H. Krawczyk. A modular approach to the design and analysis of authentication and key exchange protocols. In Proceedings of the thirtieth annual ACM symposium on Theory of computing, pages 419-428. ACM Press, 1998. Full version at http://www-cse.ucsd.edu/users/mihir/papers/key-distribution.html.
4. M. Bellare and P. Rogaway. Entity authentication and key distribution. In Advances in Cryptology - CRYPTO'93, pages 232-249. Springer-Verlag, 1993. Full version at www-cse.ucsd.edu/users/mihir.
5. M. Bellare and P. Rogaway. Provably secure session key distribution - the three party case. In Proceedings of the 27th ACM Symposium on the Theory of Computing, 1995.
6. D. Boneh and M. Franklin. Identity-based encryption from the Weil pairing. In J. Kilian, editor, Advances in Cryptology - CRYPTO 2001, 21st Annual International Cryptology Conference, volume 2139 of LNCS, pages 213-229. Springer Verlag, 2001.
7. D. Boneh and M. Franklin. Identity-based encryption from the Weil pairing. SIAM J. Computing, 32(3):586-615, 2003. http://www.crypto.stanford.edu/~dabo/abstracts/ibe.html, full version of [6].
8. D. Boneh, H. Shacham, and B. Lynn. Short signatures from the Weil pairing. In C. Boyd, editor, Advances in Cryptology - ASIACRYPT 2001, volume 2248 of LNCS, pages 514-532. Springer-Verlag, 2001.
9. M.S. Borella, Methods, and protocols for secure key negotiation using IKE. IEEE Network, pages 18-29, July/August 2000.
10. M. Burrows, M. Abadi, and R. Needham. A logic of authentication. Proceedings of the Royal Society, A426:233-271, 1989.
11. R. Canetti and H. Krawczyk. Analysis of key-exchange protocols and their use for building secure channels. In Advances in Cryptology - Eurocrypt 2001, volume 2045 of LNCS, pages 453-474. Springer-Verlag, 2001. http://eprint.iacr.org/2001/040.pg.gz.
12. R. Canetti and H. Krawczyk. Security analysis of IKE's signature-based keyexchange protocol. In Advances in Cryptology - Crypto 2002, 2002.
13. P.-C. Cheng. An architecture for the Internet Key Exchange protocol. IBM Systems Journal, 40(3):721-745, 2001.
14. W. Diffie and M. Hellman. New directions in cryptography. IEEE Transaction on Information Theory, 22:644-654, 1976.
15. R. Dupont and A. Enge. Practical non-interactive key distribution based on pairings. Cryptology ePrint Archive, Report 2002/136, 2002. http://eprint.iacr.org/.
16. R. Dupont, A. Enge, and F. Morain. Building curves with arbitrary small MOV degree over finite prime fields. Cryptology ePrint Archive, Report 2002/094, 2002. http://eprint.iacr.org/.
17. N. Ferguson and B. Schneier. A cryptographic evaluation of IPsec. http://www.counterpane.com/ipsec.html, 2000.
18. S. D. Galbraith. Supersingular curves in cryptography. In C. Boyd, editor, Proceedings of AsiaCrypt 2001, 7th International Conference on the Theory and Application of Cryptology and Information Security, volume 2248 of LNCS, pages 495-513. Springer-Verlag, 2001.
19. S. D. Galbraith, K. Harrison, and D. Soldera. Implementing the Tate pairing. In Algorithmic Number Theory 5th International Symposium, ANTS-V, volume 2369 of LNCS, pages 324-337. Springer-Verlag, 2002.
20. M. Girault. Self-certified public keys. In Advances in Cryptology - Eurocrypt 1991, LNCS, pages 490-497. Springer-Verlag, 1991.
21. D. Harkins and D. Carrel. The Internet Key Exchange (IKE), November 1998. Internet RFC 2409.
22. D. Harkins, C. Kaufman, T. Kivinen, S. Kent, and R. Perlman. Design Rationale for IKEv2, February 2002. Internet Draft.
23. A. Joux. A one round protocol for tripartite Diffie-Hellman. In W. Bosma, editor, Algorithmic Number Theory, IV-th Symposium (ANTS IV), Lecture Notes in Computer Science 1838, pages 385-394. Springer-Verlag, 2000.
24. H. Krawczyk. SIGMA: The SIGn and MAc approach to authenticated Diffie-Hellman and its use in the IKE protocols, http://www.ee.technion.ac.il/~hugo/sigma.html.
25. G. Lowe. Some new attacks upon security protocols. In 9th IEEE Computer Security Foundations Workshop, pages 162-169. IEEE Computer Society Press, 1996.
26. W. Mao and K.G. Paterson. On the plausible deniability feature of Internet protocols. http://www.isg.rhul.ac.uk/~kp/IKE.ps, 2002.
27. A.J. Menezes, T. Okamoto, and S.A. Vanstone. Reducing elliptic curve logarithms to a finite field. IEEE Trans. Info. Theory, 39:1636-1646, 1983.
28. R.M. Needham and M.D. Schroeder. Using encryption for authentication in large networks of computers. Communications of the ACM, 21(12):993-999, December 1978.
29. K.G. Paterson. Cryptography from pairings: A snapshot of current research. Information Security Technical Report, 7(3):41-54, 2002. http://www.isg.rhul.ac.uk/~kp/pairings.ps.
30. R. Perlman and C. Kaufman. Key exchange in IPSec: Analysis of IKE. IEEE Internet Computing, pages 50-56, November-December 2000.
31. S. Saeednia. A note on Girault's self-certified model. Information Processing Letters, 86:323-327, 2003.
32. R. Sakai, K. Ohgishi, and M. Kasahara. Cryptosystems based on pairing. In The 2000 Sympoium on Cryptography and Information Security, Okinawa, Japan, January 2000.
33. A. Shamir. Identity-based cryptosystems and signature schemes. In Proceedings of Crypto 84, pages 47-53. Springer-Verlag, 1985.
34. E. R. Verheul. Evidence that XTR is more secure than supersingular elliptic curve cryptosystems. In B. Pfitzmann, editor, Advances in Cryptology - Proceedings of EUROCRYPT'01, Lecture Notes in Computer Science 2045, pages 195-210. Springer-Verlag, 2001.
35. J. Zhou. Fixing a security flaw in IKE protocols. Electronics Letters, 35(13):1072-1073, 24th June 1999.
36. J. Zhou. Further analysis of the Internet key exchange protocol. Computer Communications, 23:1606-1612, 2000.