An On-Demand Fault-Tolerant Routing Strategy for Secure Key Distribution Network
-
Published:2024-01-27
Issue:3
Volume:13
Page:525
-
ISSN:2079-9292
-
Container-title:Electronics
-
language:en
-
Short-container-title:Electronics
Author:
Wu Zhiwei12, Deng Haojiang12, Li Yang12
Affiliation:
1. National Network New Media Engineering Research Center, Institute of Acoustics, Chinese Academy of Sciences, No. 21, North Fourth Ring Road, Haidian District, Beijing 100190, China 2. School of Electronic, Electrical and Communication Engineering, University of Chinese Academy of Sciences, No. 19(A), Yuquan Road, Shijingshan District, Beijing 100049, China
Abstract
The point-to-point key distribution technology based on twinning semiconductor superlattice devices can provide high-speed secure symmetric keys, suitable for scenarios with high security requirements such as the one-time pad cipher. However, deploying these devices and scaling them in complex scenarios, such as many-to-many communication, poses challenges. To address this, an effective solution is to build a secure key distribution network for communication by selecting trusted relays and deploying such devices between them. The larger the network, the higher the likelihood of relay node failure or attack, which can impact key distribution efficiency and potentially result in communication key leakage. To deal with the above challenges, this paper proposes an on-demand fault-tolerant routing strategy based on the secure key distribution network to improve the fault tolerance of the network while ensuring scalability and availability. The strategy selects the path with better local key status through a fault-free on-demand path discovery mechanism. To improve the reliability of the communication key, we integrate an acknowledgment-based fault detection mechanism in the communication key distribution process to locate the fault, and then identified the cause of the fault based on the Dempster–Shafer evidence theory. The identified fault is then isolated through subsequent path discovery and the key status is transferred. Simulation results demonstrate that the proposed method outperforms OSPF, the adaptive stochastic routing and the multi-path communication scheme, achieving an average 20% higher packet delivery ratio and lower corrupted key ratio, thus highlighting its reliability. Additionally, the proposed solution exhibits a relatively low local key overhead, indicating its practical value.
Funder
Strategic Priority Research Program of Chinese Academy of Sciences: Information Collaborative Service and Data Sharing
Subject
Electrical and Electronic Engineering,Computer Networks and Communications,Hardware and Architecture,Signal Processing,Control and Systems Engineering
Reference39 articles.
1. Rescorla, E. (2023, December 27). The Transport Layer Security (TLS) Protocol Version 1.3. IETF RFC 8846. Available online: https://www.rfc-editor.org/rfc/rfc8446. 2. Shor, P.W. (1994, January 20–22). Algorithms for quantum computation: Discrete logarithms and factoring. Proceedings of the 35th Annual Symposium on Foundations of Computer Science, Santa Fe, NM, USA. 3. Using quantum key distribution for cryptographic purposes: A survey;Branciard;Theor. Comput. Sci.,2014 4. Elliott, C., Pearson, D., and Troxel, G. (2003, January 25–29). Quantum cryptography in practice. Proceedings of the 2003 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications, Karlsruhe, Germany. 5. A secret key distribution technique based on semiconductor superlattice chaos devices;Liu;Sci. Bull.,2018
|
|