skip to main content
article

Improvement of authenaticated multiple-key agreement protocol

Published: 01 July 2004 Publication History

Abstract

Recently, Yen and Joye showed that Harn and Lin's authenticated multiple-key agreement protocol is insecure against forgery and consequently proposed a revised protocol to repair it. Later, Wu et al. showed that Yen-Joye revision is also insecure and therefore an improved protocol was proposed. However, Wu et al.'s protocol violates the original requirement in which no one-way hash function is needed. On the other hand, in order to overcome Yen-Joye and Wu et al.'s attacks, Harn and Lin proposed a modified version by modifying the signature signing equation. But the modified version increases one exponentiation in the verification equation. Afterward Zhou et al. showed that the second Harh-Lin protocol is insecure against impersonation attack, i. e., a cheater can impersonate a valid user to execute the protocol successfully and obtains parts of the valid session keys. Then they proposed an improved version to enhance the second Harh-Lin protocol. In this paper, we first show that Zhou et al.'s protocol still suffers the impersonation attack, then we propose an improved scheme that is secure against forgery and doesn't involve any one-way hash function. Compared with all above modified versions, our scheme is secure and efficient.

References

[1]
L. HARN, and H. Y. LIN, An authenticated key agreement protocol without using one-way function. Proc. 8th National Conf. Information Security, Kaohsiung, Taiwan, pp. 155--160, (1998)
[2]
S. M. YEN, and M. JOYE, Improved authenticated multiple-key agreement protocol, Electron. Lett., pp. 1738--1739, (1998)
[3]
T. S. WU, W. H. HE, and C. L HSU, Security of authenticated multiple-key agreement protocols, Electron. Lett., pp. 391--392 (1999)
[4]
L. HARN, and H. Y. LIN, Authenticated key agreement protocol without using one-way functions. Electron. Lett., pp. 629--630 (2001)
[5]
H. S. Zhou, L. Fan and J. H. Li, Remarks on unknown key share attack on authenticated multiple-key agreement protocol, Electron. Lett., pp. 1248--1249, (2003)
[6]
C. H. LIM, and P. J. LEE, Security of interactive DSA batch verification, Electron. Lett., pp. 1592--1593 (1994)
[7]
K. H. Rosen, Elementary Number Theory and Its Application-3rd edition, (1992)
[8]
R. C. Peralta, A Simple and fast probabilistic algorithm for computing square roots modulo a prime number. IEEE Trans. on Information Theory, Vol. 32, No. 6, pp. 846--847. (1986)

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM SIGOPS Operating Systems Review
ACM SIGOPS Operating Systems Review  Volume 38, Issue 3
July 2004
96 pages
ISSN:0163-5980
DOI:10.1145/1035834
Issue’s Table of Contents

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 July 2004
Published in SIGOPS Volume 38, Issue 3

Check for updates

Author Tags

  1. authenticated
  2. key agreement
  3. multiple-key

Qualifiers

  • Article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • 0
    Total Citations
  • 109
    Total Downloads
  • Downloads (Last 12 months)1
  • Downloads (Last 6 weeks)0
Reflects downloads up to 14 Feb 2025

Other Metrics

Citations

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media