A fast and secure elliptic curve based authenticated key agreement protocol for low power mobile communications

被引:0
作者
Abi-Char, Pierre E. [1 ]
Mhamed, Abdallah [1 ]
El-Hassan, Bachar [2 ]
机构
[1] Inst Natl Telecommun, GET, CNRS, UMR 5157, 9 Rue C Fourier, F-91011 Evry, France
[2] Libanese Univ, Fac Engn, Tripoli, Lebanon
来源
NGMAST 2007: 2007 INTERNATIONAL CONFERENCE ON NEXT GENERATION MOBILE APPLICATIONS, SERVICES AND TECHNOLOGIES | 2007年
关键词
D O I
暂无
中图分类号
TN [电子技术、通信技术];
学科分类号
0809 ;
摘要
The increasing progress in wireless mobile communication has attracted an important amount of attention on the security issue. To provide secure communication for mobile devices, authenticated key agreement protocol is an important primitive for establishing session key. So far several protocols have been proposed to provide robust mutual authentication and key establishment for wireless local area network (WLAN). In this paper we present a fast and Secure Authenticated Key Agreement (EC-SAKA) protocol based on Elliptic Curve Cryptography. Our proposed protocol provides secure mutual authentication, key establishment and key confirmation over an untrusted network. The new protocol achieves many of the required security and performance properties. It can resist dictionary attacks mounted by either passive or active networks intruders. It can resist Man-In-The Middle attack. It also offers perfect forward secrecy which protects past sessions and passwords against future compromise. In addition, it can resist known-key and resilience to server attack. Our proposed protocol uses ElGamal signature techniques (ECEGS). We show that our protocol meets the above security attributes under the assumption that the elliptic curve discrete logarithm problem is secure. Our proposed protocol offers significantly improved performance in computational and communication load over comparably many authenticated key agreement protocols such as B-SPEKE, SRP AMP PAK-RY PAK-X, SKA, LR-AKE and EC-SRP.
引用
收藏
页码:235 / +
页数:2
相关论文
共 20 条
[1]  
Blake-Wilson S, 1997, LECT NOTES COMPUT SC, V1355, P30, DOI 10.1007/BFb0024447
[2]  
Boyko V, 2000, LECT NOTES COMPUT SC, V1807, P156
[3]   A REMARK CONCERNING M-DIVISIBILITY AND THE DISCRETE LOGARITHM IN THE DIVISOR CLASS GROUP OF CURVES [J].
FREY, G ;
RUCK, HG .
MATHEMATICS OF COMPUTATION, 1994, 62 (206) :865-874
[4]  
HIDEKI I, 2005, IEEE WIRL COMM NETW, P1180
[5]   Extended password key exchange protocols immune to dictionary attack [J].
Jablon, DP .
SIXTH IEEE WORKSHOPS ON ENABLING TECHNOLOGIES: INFRASTRUCTURE FOR COLLABORATIVE ENTERPRISES, PROCEEDINGS, 1997, :248-255
[6]  
Jung J. K. K., 2003, P ICICSPCM 2003 SING
[7]  
KOBLITZ N, 1987, MATH COMPUT, V48, P203, DOI 10.1090/S0025-5718-1987-0866109-5
[8]  
KOBLITZ N, 1992, P CRYPT 91 SANT BARB
[9]  
KWON T, ULTIMATE SOLUTION AU
[10]  
Law M. Q. J. S. L., DESIGNS CODES CRYPTO, V28