On the importance of public-key validation in the mqv and hmqv key agreement protocols

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

Volumn 4329 LNCS, Issue , 2006, Pages 133-147

  Menezes, Alfred ^a   Ustaoglu, Berkant ^a  

^a UNIVERSITY OF WATERLOO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

DIFFIE HELLMAN KEY AGREEMENT PROTOCOL; DISCRETE LOGARITHMS; KEY AGREEMENT PROTOCOL; PRIVATE KEY; PUBLIC KEYS; SECURITY PROOFS;

PUBLIC KEY CRYPTOGRAPHY;

EID: 85009720314     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11941378_11     Document Type: Conference Paper

References (27)

1. ANSI X9.42, Public Key Cryptography for the Financial Services Industry: Agreement of Symmetric Keys Using Discrete Logarithm Cryptography, American National Standards Institute, 2003.
2. ANSI X9.63, Public Key Cryptography for the Financial Services Industry: Key Agreement and Key Transport Using Elliptic Curve Cryptography, American National Standards Institute, 2001.
3. A. Antipa, D. Brown, A. Menezes, R. Struik and S. Vanstone, “Validation of elliptic curve public keys”, Public Key Cryptography – PKC 2003, Lecture Notes in Computer Science, 2567 (2003), 211-223.
4. E. Bangerter, J. Camenisch and U. Maurer, “Efficient proofs of knowledge of discrete logarithms and representations in groups with hidden order”, Public Key Cryptography – PKC 2005, Lecture Notes in Computer Science, 3386 (2005), 154-171.
5. I. Biehl, B. Meyer and V. Müller, “Differential fault analysis on elliptic curve cryp-tosystems”, Advances in Cryptology – CRYPTO 2000, Lecture Notes in Computer Science, 1880 (2000), 131-146.
6. R. Canetti and H. Krawczyk, “Analysis of key-exchange protocols and their use for building secure channels”, Advances in Cryptology – EUROCRYPT 2001, Lecture Notes in Computer Science, 2045 (2001), 453-474. Full version available at http://eprint.iacr.org/2001/040/.
7. L. Chen, Z. Cheng and N. Smart, “Identity-based key agreement protocols from pairings”, Cryptology ePrint Archive: Report 2006/199. Available at http://eprint.iacr.org/2006/199.
8. FIPS 186-2, Digital Signature Standard (DSS), Federal Information Processing Standards Publication 186-2, National Institute of Standards and Technology, 2000.
9. IEEE Std 1363-2000, Standard Specifications for Public-Key Cryptography, 2000.
10. B. Kaliski, “An unknown key-share attack on the MQV key agreement protocol”, ACM Transactions on Information and System Security, 4 (2001), 275-288.
11. D. Knuth, Seminumerical Algorithms, vol. 2 of Art of Computer Programming, 3rd ed., Addison-Wesley, 1997.
12. H. Krawczyk, “HMQV: A high-performance secure Diffie-Hellman protocol”, Advances in Cryptology – CRYPTO 2005, Lecture Notes in Computer Science, 3621 (2005), 546-566.
13. H. Krawczyk, “HMQV: A high-performance secure Diffie-Hellman protocol”, Full version of [12], available at http://eprint.iacr.org/2005/176/.
14. H. Krawczyk, “HMQV in IEEE P1363”, submission to the IEEE P1363 working group, July 7 2006. Available at http://grouper.ieee.org/groups/1363/P1363-Reaffirm/submissions/krawczyk-hmqv-spec.pdf.
15. S. Kunz-Jacques, G. Martinet, G. Poupard and J. Stern, “Cryptanalysis of an efficient proof of knowledge of discrete logarithm”, Public Key Cryptography – PKC 2006, Lecture Notes in Computer Science, 3958 (2006), 27-43.
16. L. Law, A. Menezes, M. Qu, J. Solinas and S. Vanstone, “An efficient protocol for authenticated key agreement”, Designs, Codes and Cryptography, 28 (2003), 119-134.
17. P. Leadbitter and N. Smart, “Analysis of the insecurity of ECMQV with partially known nonces”, Information Security – ISC 2003, Lecture Notes in Computer Science, 2851 (2003), 240-251.
18. C. Lim and P. Lee, “A key recovery attack on discrete log-based schemes using a prime order subgroup”, Advances in Cryptology – CRYPTO ’97, Lecture Notes in Computer Science, 1294 (1997), 249-263.
19. A. Menezes, “Another look at HMQV”, Journal of Mathematical Cryptology, to appear. Available at http://eprint.iacr.org/2005/205/.
20. A. Menezes, P. van Oorschot and S. Vanstone, Handbook of Applied Cryptography, CRC Press, 1996.
21. A. Menezes and Y.-H. Wu, “The discrete logarithm problem in GL(n, q), Ars Com-binatoria, 47 (1998), 23-32.
22. D. Naccache, N. Smart, and J. Stern, “Projective coordinates leak”, Advances in Cryptology – EUROCRYPT 2004, Lecture Notes in Computer Science, 3027 (2004), 257-267.
23. D. Pointcheval and J. Stern, “Security arguments for digital signatures and blind signatures”, Journal of Cryptology, 13 (2000), 361-396.
24. J. Pollard, “Monte Carlo methods for index computation mod p”, Mathematics of Computation, 32 (1978), 918-924.
25. R. Schoof, “Elliptic curves over finite fields and the computation of square roots mod p”, Mathematics of Computation, 44 (1985), 483-494.
26. N. Smart, “The exact security of ECIES in the generic group model”, Cryptography and Coding, Lecture Notes in Computer Science, 2260 (2001), 73-84.
27. SP 800-56A Special Publication 800-56A, Recommendation for Pair-Wise Key Establishment Schemes Using Discrete Logarithm Cryptography, National Institute of Standards and Technology, March 2006.