Abstract
The use of cryptographic system to provide the privacy of transmitted message over network is increasing gradually. A key agreement protocol is the most important part to establish a secure cryptographic system and the effort to standardize the key agreement protocols is in rapid progress. In this paper, we study properties and operation of standard key agreement protocols and analyze the security of their protocols under several active attacker models such as active impersonation, key-compromised impersonation, (full/half ) forward secrecy, known-key passive attack, known-key impersonation attack and so on. Then, we suggest the standard for selecting key agreement protocols for each application, and find the most suitable key agreement protocol for each application.
Research supported by the KISA (Korea Information Security Agency) under project 2001-S-092.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
ANSI X9.42, “Agreement of symmetric Key on Using Diffie-Hellman Cryptography,” (2001)
ANSI X9.63, “Public Key Cryptography for the financial services industry: key agreement and key transport using elliptic curve cryptography,” (2001)
S. Blake-Wilson, D. Johnson, A. Menezes, “Key agreement protocols and their security analysis,” Cryptography and Coding, Lecture Notes in Computer Science 1355, pp. 30–45, (1997)
W. Diffie, M.E. Hellman, “New directions in cryptography,” IEEE Transaction of Information Theory, IT-22, 6, pp. 644–654, (1976)
W. Diffie, P.C. Oorschot, M.J. Wiener, “Authentication and Authenticated Key Exchange,” Designs, Codes and Cryptography, pp. 107–125, (1992)
IEEE P1363, “Standard for Public-Key Cryptography,” Working draft D13, (1999)
D. Johnson, “Diffie-Hellman Key Agreement Small Subgroup Attack,” a Contribution to X9F1 by Certicom, July, (1996)
S.J. Kim, M. Mambo et al, “On the security of the Okamoto-Tanaka ID-Based Key Exchange scheme against Active attacks,” IEICE Trans, pp. 231–238, Jan. (2001)
M. Mambo and H. Shizuya, “A note on the complexity of breaking Okamoto-Tanaka ID-based key exchange scheme,” IEICE Trans. Fundamentals, vol. E82-A, no.1, pp. 77–80, Jan, (1999)
R.A. Rueppel, P.C. van Oorschot, “Modern Key Agreement Techniques,” Computer Communications, pp. 458–465, (1994)
RSA Laboratories Technical Note v1.4, “PKCS #3: Diffie-Hellman Key Agreement Standard,” (1993)
R.A Rueppel and P.C van Oorschot, “Modern Key Agreement Techniques,” Computer communications volume 17 number 7, pp. 458–465, (1994)
K. Sakurai and H. Shizuya, “Relationships among the computational powers of breaking discrete log cryptosystems,” Proc. Eurocrypto’ 95 LNCS 921, pp. 341–355, Springer-Verlag, (1995)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Oh, S., Kwak, J., Lee, S., Won, D. (2003). Security Analysis and Applications of Standard Key Agreement Protocols. In: Kumar, V., Gavrilova, M.L., Tan, C.J.K., L’Ecuyer, P. (eds) Computational Science and Its Applications — ICCSA 2003. ICCSA 2003. Lecture Notes in Computer Science, vol 2668. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44843-8_21
Download citation
DOI: https://doi.org/10.1007/3-540-44843-8_21
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40161-2
Online ISBN: 978-3-540-44843-3
eBook Packages: Springer Book Archive