Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Path Hopping: an MTD Strategy for Quantum-safe Communication

Reihaneh Safavi–Naini, Alireza Poostindouz, Viliam Lisý

Published Oct 30, 2017• 6 citations
Publisher

Abstract

Moving target defense (MTD) strategies have been widely studied for securing computer communication systems. We consider using MTD strategies as a cryptographic mechanism for providing secure communication when the adversary has access to a quantum computer and security is required over a long period of time. We assume Alice and Bob are connected by multiple disjoint paths, not all of which can be eavesdropped by the attacker at the same time. We propose a cryptographic system that uses an MTD strategy that achieves long-term quantum-safe security. We model the system as a Markov chain, and propose two security measures that correspond to two types of adversaries, called risk-taking and risk-averse. Our numerical simulations shows dependencies between system parameters, and leads to new insights, such as quantifying the cost of being a risk-averse adversary.

DOI
10.1145/3140549.3140560

Related papers

Quantum-Augmented Privacy in Defense Communications

Christos P. Beretas

Quantum computing's quick growth brings chances and risks to defense communication systems. Current methods that protect military networks could be at risk from quantum attacks, making new privacy systems necessary. This article looks into adding quantum tech like quantum key distribution, post-quantum crypto, and mixed security setups to make defense communications more secure. Using quantum mechanics, these systems can offer secure key exchange and protection from spying. The article studies ways to add quantum-safe methods to military communication, looks at possible performance problems, and talks about how to use them in defense. The results show that a layered approach, using quantum crypto with security methods, can greatly improve security in crucial communication channels. This work helps create secure communication systems that can stand against both types of attacks.

International Journal of Innovative Research in Electronics and Communications•Apr 16, 2026•0 citations

Turning Quantum Cryptography against itself: How to avoid indirect eavesdropping in quantum networks by passive and active adversaries

Stefan Raß, Sandra König

Abstract—Quantum networks are communication networks in which adjacent nodes enjoy perfectly secure channels thanks to quantum key distribution (QKD). While QKD is renowned for perfect point-to-point security and its eavesdropping detec-tion capabilities, end-to-end security is nontrivial to achieve. More importantly, the eavesdropping detection can indeed be turned against the system itself. It is known that perfect end-to-end security can be created from point-to-point security by means of multipath transmission (in fact, there is no other way to do this, assuming no pre-shared secrets and avoiding public-key cryptography). However, multipath transmission requires node-disjoint paths, which in turn are to be assured by the underlying routing protocol. At this point, an active or passive adversary may intentionally eavesdrop on the QKD protocol to temporarily cut a channel and to cause key-buffers running empty and enforcing local rerouting of packets towards nodes under his control. Consequently, the multipath transmission channels might no longer be non-intersecting, thus defeating the overall security by exploiting QKD’s eavesdropping detec-tion facilities. Alternatively, an active adversary may as well insert bogus traff c to cause local congestion, thus even sparing the effort of eavesdropping on a QKD link. In this work, we use Markov chains to model a multipath transmission, and we discuss the extent to which secure multipath transmission is resilient against local congestions caused by an adversary. We argue that a protection against an active adversary who uses bogus traff c to f ddle with the routing, calls for additional security measures, perhaps even beyond the capabilities of QKD or multipath transmission. It turns out that robustness against passive and active adversaries can be retained as long as no bogus traff c is observed.

•Jan 1, 2012•18 citations

Quantum Networks and Cyber Security. A Simulation Case Study for Multi-Hop QKD Networks

Sorin Soviany, Cristina-Gabriela GHEORGHE, Maria Gheorghe-Moisii

The paper addresses the Quantum Networks (QN) performance with Quantum Key Distribution (QKD) protocols.The focus is on networks with multi-hop paths (multiple QKD links with intermediate nodes).QKD emerged as a promising technology to ensure unconditioned communications security by exploiting the Quantum Computing (QC) and quantum principles.While the Point-to-Point (P2P) QKD links are well understood for several QKD protocols, the challenges concern the development of QN with multiple intermediate nodes and links.The deployment of quantum-secure communication systems over very large distances requires multi-hop QN.This paper presents a simulation-based case study for multi-hop QKD networks, focusing on the performance evaluation and the Cyber Security implications.The framework could be used to evaluate end-to-end key generation rates, latency, and resilience under various network topologies and link conditions.This methodology will allow to properly investigate how the network-level security policies can be integrated with QKD protocols to detect and mitigate both passive and active attacks.One could find out the trade-offs between hop count, security margins, and throughput, providing insights into the design of robust and scalable quantumsecure communication infrastructures.This study will support the research about the integration of the QKD with the classical network management, conventional security mechanisms and advanced Cyber defense strategies.

Romanian Cyber Security Journal•Nov 5, 2025•0 citations

Quantum-Resilient Cryptography and Safe Guarding Post Quantum Cryptographic Protocols Against Quantum Threats

S Hemajothi, Keerthana B, Janani R +1 more

The Hybrid approach in Quantum Cryptography creates adaptable security model which provides the safest Communication in the emerging quantum era. The development of quantum computing raise questions about the long-term security. Traditional algorithms, such as RSA, ECC, and Diffie-Hellman, which is seemed computationally secure but it can be effectively solved by quantum algorithms such as Shor's and Grover's. This problem leads to the origination of two key trends in current studies, namely Post-Quantum Cryptography (PQC), designing mathematical approaches to encryption resistant to quantum attacks; Quantum Key Distribution (QKD) using the principles of quantum mechanics to assure security in communications. Accordingly, this research proposes a hybrid security framework including reliable data encryption and authentication using PQC, combined with the safe key- exchange method of QKD. The model is implemented in Python, Qiskit, and PQClean's Kyber and Dilithium algorithms to show how these two paradigms can cooperate toward quantum- resilient communication. To present the system performance, key exchange efficiency, computational overhead, and security strength have been considered. According to the results, this hybrid approach gives superior defense against quantum threats while maintaining practical effectiveness for real-world applications such as cloud security, 6G networks, and the Internet of Things.

International Conference on Pervasive Computing and Social Networking (ICPCSN)•May 6, 2026•0 citations

Navigating quantum security risks in networked environments: A comprehensive study of quantum-safe network protocols

Yaser Baseri, Vikas Chouhan, Abdelhakim Senhaji Hafid

The emergence of quantum computing poses a formidable security challenge to network protocols traditionally safeguarded by classical cryptographic algorithms . This paper provides an exhaustive analysis of vulnerabilities introduced by quantum computing in a diverse array of widely utilized security protocols across the layers of the TCP/IP model, including TLS , IPsec , SSH, PGP, and more. Our investigation focuses on precisely identifying vulnerabilities susceptible to exploitation by quantum adversaries at various migration stages for each protocol while also assessing the associated risks and consequences for secure communication. We delve deep into the impact of quantum computing on each protocol, emphasizing potential threats posed by quantum attacks and scrutinizing the effectiveness of post-quantum cryptographic solutions. Through carefully evaluating vulnerabilities and risks that network protocols face in the post-quantum era, this study provides invaluable insights to guide the development of appropriate countermeasures. Our findings contribute to a broader comprehension of quantum computing’s influence on network security and offer practical guidance for protocol designers, implementers, and policymakers in addressing the challenges stemming from the advancement of quantum computing. This comprehensive study is a crucial step towards fortifying the security of networked environments in the quantum age.

arXiv:2404.08232•Computers & Security•Apr 30, 2024•91 citations

Long distance two-party quantum crypto made simple

Iordanis Kerenidis, Stephanie Wehner

Any two-party cryptographic primitive can be implemented using quantum communication under the assumption that it is difficult to store a large number of quantum states perfectly. However, achieving reliable quantum communication over long distances remains a difficult problem. Here, we consider a large network of nodes with only neighboring quantum links. We exploit properties of this cloud of nodes to enable any two nodes to achieve security even if they are not directly connected. Our results are based on techniques from classical cryptography and do not resort to technologically difficult procedures like entanglement swapping. More precisely, we show that oblivious transfer can be achieved in such a network if and only if there exists a path in the network between the sender and the receiver along which all nodes are honest. Finally, we show that useful notions of security can still be achieved when we relax the assumption of an honest path. For example, we show that we can combine our protocol for oblivious transfer with computational assumptions such that we obtain security if either there exists an honest path, or, as a backup, at least the adversary cannot solve a computational problem.

arXiv:1008.0253•Quantum Information and Computation•May 1, 2012•1 citation
Moving target defense (MTD) strategies have been widely studied for securing computer communication systems. We consider using MTD strategies as a cryptographic mechanism for providing secure communication when the adversary has access to a quantum computer and security is required over a long period of time. We assume Alice and Bob are connected by multiple disjoint paths, not all of which can be eavesdropped by the attacker at the same time. We propose a cryptographic system that uses an MTD strategy that achieves long-term quantum-safe security. We model the system as a Markov chain, and propose two security measures that correspond to two types of adversaries, called risk-taking and risk-averse. Our numerical simulations shows dependencies between system parameters, and leads to new insights, such as quantifying the cost of being a risk-averse adversary.
Quantum computing's quick growth brings chances and risks to defense communication systems. Current methods that protect military networks could be at risk from quantum attacks, making new privacy systems necessary. This article looks into adding quantum tech like quantum key distribution, post-quantum crypto, and mixed security setups to make defense communications more secure. Using quantum mechanics, these systems can offer secure key exchange and protection from spying. The article studies ways to add quantum-safe methods to military communication, looks at possible performance problems, and talks about how to use them in defense. The results show that a layered approach, using quantum crypto with security methods, can greatly improve security in crucial communication channels. This work helps create secure communication systems that can stand against both types of attacks.
Abstract—Quantum networks are communication networks in which adjacent nodes enjoy perfectly secure channels thanks to quantum key distribution (QKD). While QKD is renowned for perfect point-to-point security and its eavesdropping detec-tion capabilities, end-to-end security is nontrivial to achieve. More importantly, the eavesdropping detection can indeed be turned against the system itself. It is known that perfect end-to-end security can be created from point-to-point security by means of multipath transmission (in fact, there is no other way to do this, assuming no pre-shared secrets and avoiding public-key cryptography). However, multipath transmission requires node-disjoint paths, which in turn are to be assured by the underlying routing protocol. At this point, an active or passive adversary may intentionally eavesdrop on the QKD protocol to temporarily cut a channel and to cause key-buffers running empty and enforcing local rerouting of packets towards nodes under his control. Consequently, the multipath transmission channels might no longer be non-intersecting, thus defeating the overall security by exploiting QKD’s eavesdropping detec-tion facilities. Alternatively, an active adversary may as well insert bogus traff c to cause local congestion, thus even sparing the effort of eavesdropping on a QKD link. In this work, we use Markov chains to model a multipath transmission, and we discuss the extent to which secure multipath transmission is resilient against local congestions caused by an adversary. We argue that a protection against an active adversary who uses bogus traff c to f ddle with the routing, calls for additional security measures, perhaps even beyond the capabilities of QKD or multipath transmission. It turns out that robustness against passive and active adversaries can be retained as long as no bogus traff c is observed.
The paper addresses the Quantum Networks (QN) performance with Quantum Key Distribution (QKD) protocols.The focus is on networks with multi-hop paths (multiple QKD links with intermediate nodes).QKD emerged as a promising technology to ensure unconditioned communications security by exploiting the Quantum Computing (QC) and quantum principles.While the Point-to-Point (P2P) QKD links are well understood for several QKD protocols, the challenges concern the development of QN with multiple intermediate nodes and links.The deployment of quantum-secure communication systems over very large distances requires multi-hop QN.This paper presents a simulation-based case study for multi-hop QKD networks, focusing on the performance evaluation and the Cyber Security implications.The framework could be used to evaluate end-to-end key generation rates, latency, and resilience under various network topologies and link conditions.This methodology will allow to properly investigate how the network-level security policies can be integrated with QKD protocols to detect and mitigate both passive and active attacks.One could find out the trade-offs between hop count, security margins, and throughput, providing insights into the design of robust and scalable quantumsecure communication infrastructures.This study will support the research about the integration of the QKD with the classical network management, conventional security mechanisms and advanced Cyber defense strategies.
The Hybrid approach in Quantum Cryptography creates adaptable security model which provides the safest Communication in the emerging quantum era. The development of quantum computing raise questions about the long-term security. Traditional algorithms, such as RSA, ECC, and Diffie-Hellman, which is seemed computationally secure but it can be effectively solved by quantum algorithms such as Shor's and Grover's. This problem leads to the origination of two key trends in current studies, namely Post-Quantum Cryptography (PQC), designing mathematical approaches to encryption resistant to quantum attacks; Quantum Key Distribution (QKD) using the principles of quantum mechanics to assure security in communications. Accordingly, this research proposes a hybrid security framework including reliable data encryption and authentication using PQC, combined with the safe key- exchange method of QKD. The model is implemented in Python, Qiskit, and PQClean's Kyber and Dilithium algorithms to show how these two paradigms can cooperate toward quantum- resilient communication. To present the system performance, key exchange efficiency, computational overhead, and security strength have been considered. According to the results, this hybrid approach gives superior defense against quantum threats while maintaining practical effectiveness for real-world applications such as cloud security, 6G networks, and the Internet of Things.
The emergence of quantum computing poses a formidable security challenge to network protocols traditionally safeguarded by classical cryptographic algorithms . This paper provides an exhaustive analysis of vulnerabilities introduced by quantum computing in a diverse array of widely utilized security protocols across the layers of the TCP/IP model, including TLS , IPsec , SSH, PGP, and more. Our investigation focuses on precisely identifying vulnerabilities susceptible to exploitation by quantum adversaries at various migration stages for each protocol while also assessing the associated risks and consequences for secure communication. We delve deep into the impact of quantum computing on each protocol, emphasizing potential threats posed by quantum attacks and scrutinizing the effectiveness of post-quantum cryptographic solutions. Through carefully evaluating vulnerabilities and risks that network protocols face in the post-quantum era, this study provides invaluable insights to guide the development of appropriate countermeasures. Our findings contribute to a broader comprehension of quantum computing’s influence on network security and offer practical guidance for protocol designers, implementers, and policymakers in addressing the challenges stemming from the advancement of quantum computing. This comprehensive study is a crucial step towards fortifying the security of networked environments in the quantum age.
Any two-party cryptographic primitive can be implemented using quantum communication under the assumption that it is difficult to store a large number of quantum states perfectly. However, achieving reliable quantum communication over long distances remains a difficult problem. Here, we consider a large network of nodes with only neighboring quantum links. We exploit properties of this cloud of nodes to enable any two nodes to achieve security even if they are not directly connected. Our results are based on techniques from classical cryptography and do not resort to technologically difficult procedures like entanglement swapping. More precisely, we show that oblivious transfer can be achieved in such a network if and only if there exists a path in the network between the sender and the receiver along which all nodes are honest. Finally, we show that useful notions of security can still be achieved when we relax the assumption of an honest path. For example, we show that we can combine our protocol for oblivious transfer with computational assumptions such that we obtain security if either there exists an honest path, or, as a backup, at least the adversary cannot solve a computational problem.