A Fully Authenticated Diffie-Hellman Protocol and Its Application in WSNs

被引:7
|
作者
Sun, Fajun [1 ]
He, Selena [2 ]
Zhang, Xiaotong [1 ]
Zhang, Jun [3 ]
Li, Qingan [1 ]
He, Yanxiang [1 ]
机构
[1] Wuhan Univ, Sch Comp Sci, Wuhan 430072, Peoples R China
[2] Kennesaw State Univ, Dept Comp Sci, Marietta, GA 30060 USA
[3] East China Univ Technol, Sch Informat Engn, Nanchang 330000, Jiangxi, Peoples R China
基金
中国国家自然科学基金;
关键词
Protocols; Authentication; Wireless sensor networks; Security; Prototypes; Standards; Digital signatures; Authenticated key agreement; key establishment; key management; key confirmation; TinyADH;
D O I
10.1109/TIFS.2022.3173536
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
The secure authenticated key establishment between nodes in Wireless Sensor Networks (WSNs) has not been fully solved in the existing schemes. It's a good idea to apply the Diffie-Hellman protocol to address it perfectly, but the existing authenticated Diffie-Hellman (ADH) protocols are not perfect because their authentication are partial or delayed. In this paper, we first present a concept of full authentication and propose a new fully authenticated Diffie-Hellman (FADH) prototype with light-certificate-based authentication. And then based on the theory of elliptic curve cryptography, we construct the TinyADH (Tiny Authenticated Diffie-Hellman) protocol with applying the FADH in WSNs. Compared with the existing similar solutions, TinyADH has lower communication overload, is easier to implement into existing standards, and more secure under equivalent computational complexity. The experimental results show that using this scheme for a successful key agreement between two nodes averagely takes about 54 seconds on TelosB. Moreover, the simulation results indicate that repeated key agreement can improve the secure connectivity rate. However, considering the cost performance ratio, it is advisable to take 2 runs of the negotiation.
引用
收藏
页码:1986 / 1999
页数:14
相关论文
共 50 条
  • [1] A Secure and Efficient Authenticated Diffie-Hellman Protocol
    Sarr, Augustin P.
    Elbaz-Vincent, Philippe
    Bajard, Jean-Claude
    [J]. PUBLIC KEY INFRASTRUCTURES, SERVICES AND APPLICATIONS, 2010, 6391 : 83 - +
  • [2] The Diffie-Hellman protocol
    Maurer, UM
    Wolf, S
    [J]. DESIGNS CODES AND CRYPTOGRAPHY, 2000, 19 (2-3) : 147 - 171
  • [3] Authenticated Diffie-Hellman Key Agreement Protocol with Forward Secrecy
    ZHANG Chuanrong1
    2. State Key Laboratory of Information Security/Graduate University of Chinese Academy of Science
    [J]. Wuhan University Journal of Natural Sciences, 2008, (06) : 641 - 644
  • [4] An Alternative Diffie-Hellman Protocol
    Jarpe, Eric
    [J]. CRYPTOGRAPHY, 2020, 4 (01) : 1 - 10
  • [5] A Quantum Diffie-Hellman Protocol
    Subramaniam, Pranav
    Parakh, Abhishek
    [J]. 2014 IEEE 11TH INTERNATIONAL CONFERENCE ON MOBILE AD HOC AND SENSOR SYSTEMS (MASS), 2014, : 523 - 524
  • [6] Authenticated Diffie-Hellman key agreement protocols
    Blake-Wilson, S
    Menezes, A
    [J]. SELECTED AREAS IN CRYPTOGRAPHY, 1999, 1556 : 339 - 361
  • [7] Okamoto-Tanaka Revisited: Fully Authenticated Diffie-Hellman with Minimal Overhead
    Gennaro, Rosario
    Krawczyk, Hugo
    Rabin, Tal
    [J]. APPLIED CRYPTOGRAPHY AND NETWORK SECURITY, 2010, 6123 : 309 - 328
  • [8] Authenticated Diffie-Hellman key agreement protocol using a single cryptographic assumption
    Harn, L
    Hsin, WJ
    Mehta, M
    [J]. IEE PROCEEDINGS-COMMUNICATIONS, 2005, 152 (04): : 404 - 410
  • [9] Diffie-Hellman process and its use in secure and authenticated VC networks
    Panagiotopoulos, Ilias
    Dimitrakopoulos, George
    [J]. IET INTELLIGENT TRANSPORT SYSTEMS, 2018, 12 (09) : 1082 - 1087
  • [10] Diffie-Hellman Protocol as a Symmetric Cryptosystem
    Burda, Karel
    [J]. INTERNATIONAL JOURNAL OF COMPUTER SCIENCE AND NETWORK SECURITY, 2018, 18 (07): : 33 - 37