Hacking the Least Trusted Node: Indirect Eavesdropping in Quantum Networks

被引:0
|
作者
Rass, Stefan [1 ,2 ]
Mehic, Miralem [3 ,4 ,5 ]
Voznak, Miroslav [4 ,5 ]
Konig, Sandra [6 ]
机构
[1] Johannes Kepler Univ Linz, LIT Secure & Correct Syst Lab, A-4040 Linz, Austria
[2] Univ Klagenfurt, Dept Artificial Intelligence & Cybersecur, A-9020 Klagenfurt, Austria
[3] Univ Sarajevo, Fac Elect Engn, Dept Telecommun, Sarajevo 71000, Bosnia & Herceg
[4] VSB Tech Univ Ostrava, Fac Elect Engn & Comp Sci, Ostrava 70800, Czech Republic
[5] Klaipeda Univ, Marine Res Inst, LT-92295 Klaipeda, Lithuania
[6] Res Driven Solut Ltd, Greystones D08 TX29, Ireland
来源
IEEE ACCESS | 2024年 / 12卷
关键词
Routing; Relays; Security; Quantum networks; Eavesdropping; Quality of service; Protocols; Network topology; Hardware; Quantum key distribution; Denial-of-service attack; Quantum network; denial-of-service; quantum key distribution; eavesdropping; KEY-DISTRIBUTION; SECURITY;
D O I
10.1109/ACCESS.2024.3490378
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
We study the significance of the common trusted relay assumption in quantum networks. While most practical implementations of quantum networks rely on trusted devices, the question of security without this assumption has been rarely addressed. Device independent security attempts to minimize the assumptions made on the quantum hardware, entanglement based methods try to avoid relays to the extent possible, and multipath transmission improves robustness and security by enforcing the attacker to conquer more than just a single intermediate node. Common to all these past studies is their focus on the physical layer and direct connections. We describe an attack from the networking and routing layer. Assuming at least one node that is not perfectly tamper-proof, meaning that an attacker has established a foothold to read traffic from the inside, we show how to exploit the eavesdropping detection mechanisms of the quantum key distribution (QKD) devices to cause traffic redirection over the vulnerable node, thus defeating security under the trusted node assumption. We experimentally demonstrate how the attack works on networks of different size and topology, and thereby further substantiate the significance of the trust assumptions for end-to-end security of QKD networks.
引用
收藏
页码:160973 / 160981
页数:9
相关论文
共 50 条
  • [41] A Quantum Annealing Bat Algorithm for Node Localization in Wireless Sensor Networks
    Yu, Shujie
    Zhu, Jianping
    Lv, Chunfeng
    SENSORS, 2023, 23 (02)
  • [42] Novel Node Localization Algorithm Based on Nonlinear Weighting Least Square for Wireless Sensor Networks
    Xiao, Fu
    Wu, Mingtan
    Huang, Haiping
    Wang, Ruchuan
    Wang, Sudan
    INTERNATIONAL JOURNAL OF DISTRIBUTED SENSOR NETWORKS, 2012,
  • [43] Topology-Abstraction-Based Protection Scheme in Quantum Key Distribution Networks with Partially Trusted Relays
    Zhang, Qin
    Liu, Yikai
    Yu, Xiaosong
    Zhao, Yongli
    Zhang, Jie
    PHOTONICS, 2022, 9 (04)
  • [44] Hybrid Trusted/Untrusted Relay-Based Quantum Key Distribution Over Optical Backbone Networks
    Cao, Yuan
    Zhao, Yongli
    Li, Jun
    Lin, Rui
    Zhang, Jie
    Chen, Jiajia
    IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 2021, 39 (09) : 2701 - 2718
  • [45] QUANTUM KEY DISTRIBUTION NETWORKS FOR TRUSTED 5G AND BEYOND: AN ITU-T STANDARDIZATION PERSPECTIVE
    Choi, Taesang
    Kim, Hyungsoo
    Kim, Jeongyun
    Yoon, Chun Seok
    Lee, Gyu Myoung
    2021 ITU KALEIDOSCOPE CONFERENCE: CONNECTING PHYSICAL AND VIRTUAL WORLDS (ITU K), 2021, : XLVII - XLXV
  • [46] Distributed weighted least squares scaling with soft-constraint for node localization in wireless sensor networks
    Zhao, Fang
    Ma, Yan
    Lin, Quan
    Luo, Haiyong
    Yuan, Wu
    2007 SECOND INTERNATIONAL CONFERENCE IN COMMUNICATIONS AND NETWORKING IN CHINA, VOLS 1 AND 2, 2007, : 214 - +
  • [47] On Notification Message Re-broadcasting for the Node-Disjoint Multipath Routing Method in Ad Hoc Networks to Counter Eavesdropping of Data Packets
    Murakami, Tetsuya
    Kimura, Toshimasa
    Uemori, Takahide
    Kohno, Eitaro
    Kakuda, Yoshiaki
    2015 IEEE 35TH INTERNATIONAL CONFERENCE ON DISTRIBUTED COMPUTING SYSTEMS WORKSHOPS (ICDCSW), 2015, : 11 - 16
  • [48] Empirical Risk-aware Machine Learning on Trojan-Horse Detection for Trusted Quantum Key Distribution Networks
    Chou, Hong-Fu
    Vu, Thang X.
    Maity, Ilora
    Garces-Socarras, Luis M.
    Gonzalez-Rios, Jorge L.
    Merlano-Duncan, Juan Carlos
    Ma, Sean Longyu
    Chatzinotas, Symeon
    Ottersten, Björn
    arXiv,
  • [49] Diffusion Least Mean Square Algorithm for Identification of IIR System Present in Each Node of a Wireless Sensor Networks
    Dimple, Km
    Kotary, Dinesh Kumar
    Nanda, Satyasai Jagannath
    COMPUTATIONAL INTELLIGENCE IN DATA MINING, 2019, 711 : 709 - 720
  • [50] Predicting node proximity in ad-hoc networks: A least overhead adaptive model for selecting stable routes
    McDonald, AB
    Znati, T
    MOBIHOC: 2000 FIRST ANNUAL WORKSHOP ON MOBILE AND AD HOC NETWORKING AND COMPUTING, 2000, : 29 - 33