ACM Home Page
Please provide us with feedback. Feedback
Efficient authenticated key agreement protocols resistant to a denial-of-service attack
Full text PdfPdf (134 KB)
Source International Journal of Network Management archive
Volume 15 ,  Issue 3  (May 2005) table of contents
Pages: 193 - 202  
Year of Publication: 2005
ISSN:1099-1190
Author
Yuh-Min Tseng  Information Security Laboratory, Department of Mathematics, National Changhua University of Education, Jin-De Campus, Chang-Hua 500, Taiwan
Publisher
John Wiley & Sons, Inc.  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 0,   Downloads (12 Months): 16,   Citation Count: 2
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: 10.1002/nem.561

ABSTRACT

Malicious intruders may launch as many invalid requests as possible without establishing a server connection to bring server service to a standstill. This is called a denial-of-service (DoS) or distributed DoS (DDoS) attack. Until now, there has been no complete solution to resisting a DoS/DDoS attack. Therefore, it is an important network security issue to reduce the impact of a DoS/DDoS attack. A resource-exhaustion attack on a server is one kind of denial-of-service attack. In this article we address the resource-exhaustion problem in authentication and key agreement protocols. The resource-exhaustion attack consists of both the CPU-exhaustion attack and the storage-exhaustion attack. In 2001, Hirose and Matsuura proposed an authenticated key agreement protocol (AKAP) that was the first protocol simultaneously resistant to both the CPU-exhaustion attack and the storage-exhaustion attack. However, their protocol is time-consuming for legal users in order to withstand the DoS attack. Therefore, in this paper, we propose a slight modification to the Hirose-Matsuura protocol to reduce the computation cost. Both the Hirose-Matsuura and the modified protocols provide implicit key confirmation. Also, we propose another authenticated key agreement protocol with explicit key confirmation. The new protocol requires less computation cost. Because DoS/DDoS attacks come in a variety of forms, the proposed protocols cannot fully disallow a DoS/DDoS attack. However, they reduce the effect of such an attack and thus make it more difficult for the attack to succeed.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
 
2
 
3
3. Diffie W, Hellman ME. New directions in cryptography. IEEE Transactions on Information Theory 1976; IT-22(6):644-654.
 
4
4. Ankney R, Johnson D, Matyas M. The Unified Model. Contribution to ANSI X9F1, 1995.
 
5
 
6
6. Menezes AJ, Qu M, Vanstone SA. Some key agreement protocols providing implicit authentication. 2nd Workshop Selected Areas in Cryptography, 1995.
 
7
7. Tseng YM. Multi-party key agreement protocols with cheater identification. Applied Mathematics and Computation 2003; 145(2-3):551-559.
 
8
8. Tseng YM. On the security of an efficient two-pass key agreement protocol. Computer Standards and Interfaces 2004; 26(4):371-374.
 
9
 
10
10. Kwon T, Song J. Secure agreement scheme for gxy via password authentication. Electronics Letters 1999; 35(11):892-893.
 
11
11. ElGamal T. Apublic key cryptosystem and signature scheme based on discrete logarithm. IEEE Transactions on Information Theory 1985; 31(4):469-472.
 
12
12. NIST. Digital signature standard (DSS), FIPS PUB XX, 1993.
 
13
 
14
 
15
 
16
16. ITSEC. Information Technology Security Evaluation Criteria. Version 1.2, COM(92) 298 final, Brussels, 1992.
 
17
 
18
 
19
19. Hirose S, Matsuura K. Key agreement protocols resistant to a denial-of-service attack. IEICE Transactions on Information and Systems 2001; E-84-D(4):477-484.
 
20
20. Dobbertin H. The status of MD5 after a recent attack. CryptoBytes 1996; 2(2):1-6.
 
21