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

Unconditional but Not Zero-Trust: Trust Leakage in Quantum Security Architectures

Mohamed Jassar

Published Dec 27, 2025• 0 citations
Publisher

Abstract

Quantum cryptographic and quantum computing security mechanisms are frequently described as uncondition- ally secure, relying on fundamental physical laws rather than computational hardness assumptions. However, unconditional security does not necessarily imply compliance with zero-trust security principles, which assume no implicit trust in system components, participants, or adversary models. This distinction remains insufficiently examined in existing literature. This paper investigates whether contemporary quantum secu- rity architectures satisfy zero-trust requirements at the protocol and architectural level. We present three conceptual simula- tions analyzing (i) binary trust decision failures in quantum key distribution, (ii) trust leakage under escalating quantum adversary capabilities, and (iii) insider resilience in a zero-trust quantum multi-party computation framework. All simulations intentionally exclude device imperfections, side-channel attacks, and human misconfiguration to isolate trust assumptions inherent to protocol design. Results demonstrate that quantum security mechanisms rely on implicit trust anchors, bounded adversary models, and delayed failure detection, leading to silent risk accumulation even under idealized conditions. While zero-trust–inspired quantum architec- tures significantly improve adversarial resilience and early risk awareness, they do not eliminate trust entirely.

DOI
10.5281/zenodo.18065835

Related papers

Quantum-Resilient Zero-Trust Architectures in Edge Computing Networks: Theoretical Foundations and Complexity Bounds

Varshitha Manjunath, Sooraj Sathyanarayanan, Rajesh Purushothaman +3 more

In the era of advancing quantum computing, edge computing networks face unprecedented security risks due to expanded attack surfaces and resource limitations. We develop a rigorous theoretical frame-work for quantum-resilient zero-trust architectures (ZTA) tailored to these environments. Our contributions encompass: (i) security reductions demonstrating that ZTA derives quantum resistance from lattice-based hardness assumptions; (ii) precise complexity analyses establishing Θ(log n) as the tight communication bound for n-node networks; (iii) fundamental tradeoffs between differential privacy and anomaly detection utility; and (iv) impossibility theorems delineating limits under quantum adversaries. Our work is the first to provide tight complexity bounds and impossibility theorems for quantum-resilient ZTA in edge networks.

International Conference on Computer and Applications (ICCA)•Dec 22, 2025•1 citation

A Survey of Quantum Computing Security Protocols: Frameworks and Vulnerabilities

Dr Rajendirakumar S

Abstract Quantum computing promises unprecedented computational power, posing fundamental threats and offering novel solutions to modern cryptography and cybersecurity. This survey paper reviews the rapidly evolving landscape of quantum-resistant and quantum-native security protocols. By analyzing foundational computational security models and the unique vulnerabilities introduced by quantum algorithms, this work proposes a structured evaluation framework for assessing the robustness of cryptographic systems. Ultimately, this survey highlights the critical transition from classical cryptographic infrastructures to quantum-secure paradigms, ensuring data confidentiality and integrity in the post-quantum era. Keywords: Quantum Computing, Security Protocol, Vulnerabilities 1.Introduction The emergence of quantum computing represents a paradigm shift in both computational physics and information technology. Quantum algorithms, particularly Shor's and Grover's algorithms, inherently challenge the mathematical foundations of classical public-key cryptography. As a result, securing communication channels against quantum-empowered adversaries has become an urgent priority for global infrastructure and national security. The motivation for this survey stems from the immediate need to bridge the gap between theoretical quantum mechanics and applied cybersecurity, ensuring that secure communications can withstand the computational leaps expected in the next decade. The core problem addressed in this paper is the comprehensive evaluation of security protocols under the threat model of a fully scalable quantum computer. The scope encompasses both post-quantum cryptographic (PQC) protocols and inherently quantum protocols, such as those relying on physical quantum states for key distribution. Existing classical approaches are insufficient for two main reasons. First, classical computational security models often rely on mathematical hardness assumptions (like integer factorization) that are rapidly undermined by theoretical quantum algorithms. Second, current software tools for designing secure classical protocols fail to account for quantum state phenomena, such as superposition and entanglement, rendering classical verification methods inadequate for quantum threat models. To address these structural challenges, this paper presents the following contributions: We provide a comprehensive taxonomy of vulnerabilities in both classical and quantum security protocols, mapping specific algorithmic advantages to protocol failure points. We propose a structured, multi-module framework for simulating, attacking, and verifying the security of hybrid quantum-classical cryptographic architectures. 2.Foundations of Classical Protocol Analysis The rigorous analysis of security protocols has traditionally relied on well-defined computational and symbolic models (Toorani, 2016). Researchers have extensively mapped out the taxonomy of attacks on authenticated key exchange (AKE) protocols and password-authenticated key exchange (PAKE) systems, establishing the mathematical groundwork for secure communication. The core idea of these foundational works is to establish provable security bounds that distinguish between information-theoretic and computational security. While this traditional paradigm offers strong mathematical guarantees against classical adversaries, its primary weakness is the failure to incorporate quantum attack vectors into the adversary's capability profile. Our work builds upon these classical models by explicitly injecting quantum algorithmic capabilities into standard protocol verification routines. 2.1.Quantum Algorithm Development and Simulation A significant body of literature focuses on the theoretical development and computational simulation of quantum algorithms capable of compromising or enhancing network security. Academic overviews have formalized algorithms like Grover's and Shor's, demonstrating their theoretical efficiency over classical counterparts in breaking cryptographic primitives. Furthermore, researchers have developed advanced design automation tools, such as decision diagrams, to simulate and verify complex quantum circuits. The strength of these simulation tools lies in their ability to model complex quantum states without requiring expensive physical hardware. However, a notable weakness is that they often abstract away the physical noise and hardware constraints that exist in real-world cryptographic deployments. This survey contextualizes these simulation techniques specifically within the framework of adversarial security testing, bridging theoretical algorithms with practical protocol defense. 3.Physical Implementations and Hardware Considerations Beyond algorithmic theory, the physical realization of quantum states directly impacts the practical security of any quantum protocol. Research into cavity quantum electrodynamics (QED) has demonstrated the complete mathematical construction of fundamental quantum gates, such as the controlled-controlled NOT gate, operating in the weak coupling regime (Fujii et al., 2005). Additionally, methods like Quantum Computed Moments (QCM) address the hardware constraints and noise typical of Near-Term Intermediate Scale Quantum (NISQ) devices, estimating ground state properties even with suboptimal trial states. The strength of this hardware-focused research is its realism regarding current technological limits; however, it often lacks a direct bridge to high-level network protocol verification. Compared to these purely physical studies, our survey integrates physical noise models into a generalized, software-driven protocol verification framework. 4.Approach To systematically evaluate quantum computing security protocols, we propose a structured Quantum Protocol Verification Framework (QPVF). The first module is the "Threat Modeling Engine," which defines the adversary's capabilities, ranging from classical data interception to full quantum memory manipulation. The second module is the "Quantum Circuit Synthesizer," which leverages decision diagram-based tools to translate high-level cryptographic operations into verifiable quantum circuits. The final module is the "Vulnerability Analyzer," which subjects the synthesized circuits to simulated quantum attacks, effectively distinguishing between idealized computational security and realistic hardware-constrained security. This modular pipeline allows security engineers to isolate specific vulnerabilities at both the abstract algorithmic layer and the simulated physical implementation layer. A key design choice in the QPVF is the utilization of decision diagrams for circuit simulation. This choice is predicated on the fact that decision diagrams efficiently handle the exponential state space of quantum systems during complex verification tasks (Wille et al., 2021). Furthermore, our framework explicitly incorporates noise models derived from current NISQ hardware limitations, ensuring that the security evaluation reflects realistic physical constraints rather than purely idealized environments (Vallury & Hollenberg, 2023). To evaluate this framework, we propose a hypothetical benchmarking plan using an artificially generated dataset of 10,000 hybrid quantum-classical cryptographic key exchanges. We will measure the success rate of simulated Grover-based brute-force attacks against varying key sizes and simulated environmental noise levels. This evaluation will compare the theoretical vulnerability threshold of a protocol against the practical threshold observed when quantum noise severely degrades the adversary's computational capabilities. The operational flow of the QPVF is designed to provide end-to-end security verification for next-generation networks. It bridges the critical gap between abstract protocol design and simulated hardware execution. The methodology can be summarized by the following numbered pipeline: Protocol Ingestion: The classical or quantum protocol is parsed into a standardized symbolic representation. Adversary Assignment: The user assigns a precise computational profile, selecting between traditional classical algorithms or advanced quantum capabilities. Circuit Generation: Protocol steps are mapped to equivalent quantum decision diagrams for scalable software simulation. Execution & Attack: Simulated quantum algorithms are executed against the mapped circuits to test for cryptographic resilience. Output Generation: The system outputs a vulnerability score and highlights specific failure points caused by either algorithmic weaknesses or simulated hardware noise. 5.Discussion The transition to quantum-secure protocols carries profound practical implications for global information infrastructure and enterprise deployment. Deploying these advanced protocols requires immense updates to existing software toolkits, as current digital systems are not fundamentally designed to handle the complexity of quantum states. Furthermore, organizations must consider the massive educational and workforce development efforts needed to train software engineers in quantum cryptography, a requirement already highlighted by international hackathons and educational initiatives. Integrating quantum-resistant protocols into complex domains like high-energy physics networks or global banking systems will require bridging the gap between theoretical quantum mechanics and applied computer engineering. Consequently, practical deployment must occur in hybrid phases, maintaining classical cryptographic wrappers while dedicated quantum infrastructure matures. Despite the robust theoretical design of proposed quantum security frameworks, several limitations and failure modes persist in practical applications. First, physical implementation attacks, such as side-channel attacks on the lasers and cavities used in physical quantum gates can bypass theoretical software security guarant

•Mar 15, 2025•0 citations

Post-Quantum Cryptography in Zero- Trust Networks

K Rameesa, Dasari Sudhakar, Mohammed Yasir +2 more

The rapid advancement of quantum computing introduces new risks to conventional cryptographic mechanisms that safeguard digital communication. To counteract these emerging threats, Post-Quantum Cryptography (PQC) offers algorithms designed to remain secure even in the presence of quantum-capable adversaries. Simultaneously, Zero-Trust Network (ZTN) principles, which operate on the concept of continuous verification and minimal trust, have become essential for modern cybersecurity strategies. This study explores the integration of PQC techniques into ZTN frameworks to establish a resilient foundation for protecting future communication infrastructures against both classical and quantum-based attacks. This paper presents a comprehensive review of PQC algorithms, analyses their applicability in ZTN environments, and examines implementation challenges and performance considerations. The study also outlines future directions for research in secure quantum-resistant network architectures.

IEEE International Conference on Emerging Synergy Science and Technology (ICESST)•Apr 29, 2026•0 citations

Quantum-Safe Network Security: Advances in Quantum Cryptography and Systems Integration

Murali Krishna Pasupuleti

Abstract: This study advances a unifying systems perspective on quantum-safe network security by synthesizing recent progress in quantum cryptography with practical integration patterns across carrier-grade infrastructures. Concept analysis distinguishes the roles of quantum key distribution (QKD), device-independent variants, quantum authentication, and post-quantum cryptography (PQC) within zero-trust architectures. Building on this, a layered framework—spanning physical/entanglement resources, key management, crypto-agility, control plane orchestration, and policy/compliance—is articulated to support end-to-end, composable guarantees. The problem addressed is the realization of verifiable, quantum-resilient security under operational constraints involving latency, key-rate variability, and heterogeneous trust assumptions. Methodology combines a structured literature synthesis with formal composability mapping to universal composability principles, adversarial threat modeling for quantum-enabled attackers, and testbed/simulation evaluation of hybrid QKD–PQC pipelines across L2–L3 segments and 5G/6G backhaul scenarios. Key results indicate that (i) selective QKD deployment on high-value links coupled with PQC at endpoints enhances resilience while preserving crypto-agility; (ii) automated key-lifecycle orchestration reduces exposure windows; and (iii) device-independent assurances strengthen guarantees where trust relaxation is necessary. The impact is a deployment-ready reference architecture, measurable integration metrics, and guidance aligned with emerging standards for critical infrastructure and national networks. The implications extend to procurement, compliance, and roadmap planning for quantum-era network security. Keywords: quantum-safe cryptography, quantum key distribution (QKD), post-quantum cryptography (PQC), hybrid QKD–PQC, composable security, device-independent QKD, zero-trust networks, key management and orchestration, 5G/6G backhaul, network security architecture, standards and interoperability

International Journal of Academic and Industrial Research Innovations(IJAIRI)•Jan 30, 2021•59 citations

Quantum Key Distribution Protocols with Device-Independent Security

Jincheng Zhang

This paper explores the design and theoretical foundations of quantum key distribution (QKD) protocols engineered for device-independent security. The core argument presented is that achieving unconditional security in QKD is possible without relying on the assumption of perfect hardware, a limitation inherent in many existing protocols. We propose a framework leveraging Bell inequality violations to establish secure key exchange, offering a fundamentally different approach compared to traditional protocols. This approach aims to mitigate the risks associated with side-channel attacks and device imperfections. The protocol outlined here represents a significant step towards realizing truly robust and secure quantum communication systems, offering a pathway for building cryptographic infrastructure resilient to evolving threats. The key contributions lie in the theoretical rigor applied to device independence and the utilization of Bell tests as a core mechanism for establishing security. The presented model offers a starting point for future research and development in this critical area of quantum cryptography.

•Aug 31, 2026•0 citations

A Cybersecurity Paradox on Quantum Key Distribution (QKD) and a Deterministic Industrial Internet of Things (IIoT) with AI-based Zero Trust

Ted H. Szymanski

Today’s Industrial Internet of Things (IIoT) suffers from millions of classical cyber-attacks annually, including insider, outsider, Denial of Service (DoS) and eavesdropping attacks. Several proofs establish that Quantum Key Distribution (QKD) networks achieve unconditional security guaranteed by the laws of physics in theory. These proofs assume ideal QKD nodes with zero information leakage exist, which implies immunity to classical cyber-attacks that leak information. In contrast, many security agencies state that QKD is vulnerable to classical cyber-attacks, creating a Quantum Security Paradox between theory and practice. It is shown that: (i) Existing proofs of QKD’s unconditional security do not hold in practice, since the assumption of zero information leakage in the classical network is not met; and (ii) Real QKD networks are vulnerable to classical insider attacks and backdoors, which leak information. Global-scale Space-Ground QKD networks will integrate micro-satellites in space with ground-stations on earth. A new vulnerability is presented. These QKD networks are vulnerable to classical backdoors and global surveillance, wherein millions of secret QKD keys may be exposed. Unconditional-security requires complimentary methods to ensure zero information leakage in the classical network. A Quantum-Safe Deterministic IIoT (Det-IIoT) network that exploits SDN (Software Defined Networking), Artificial Intelligence (AI) and a Zero Trust Architecture (ZTA) access control system (ACS) is explored. The ZTA-ACS supports programmable deterministic classical communications between authorized QKD nodes or applications, and blocks communications from cyber-attackers. The Det-IIoT can be placed within satellites to strengthen Space-Ground QKD, by mitigating classical cyber-attacks that leak information.

IEEE Consumer Communications and Networking Conference•Jan 9, 2026•2 citations
Quantum cryptographic and quantum computing security mechanisms are frequently described as uncondition- ally secure, relying on fundamental physical laws rather than computational hardness assumptions. However, unconditional security does not necessarily imply compliance with zero-trust security principles, which assume no implicit trust in system components, participants, or adversary models. This distinction remains insufficiently examined in existing literature. This paper investigates whether contemporary quantum secu- rity architectures satisfy zero-trust requirements at the protocol and architectural level. We present three conceptual simula- tions analyzing (i) binary trust decision failures in quantum key distribution, (ii) trust leakage under escalating quantum adversary capabilities, and (iii) insider resilience in a zero-trust quantum multi-party computation framework. All simulations intentionally exclude device imperfections, side-channel attacks, and human misconfiguration to isolate trust assumptions inherent to protocol design. Results demonstrate that quantum security mechanisms rely on implicit trust anchors, bounded adversary models, and delayed failure detection, leading to silent risk accumulation even under idealized conditions. While zero-trust–inspired quantum architec- tures significantly improve adversarial resilience and early risk awareness, they do not eliminate trust entirely.
In the era of advancing quantum computing, edge computing networks face unprecedented security risks due to expanded attack surfaces and resource limitations. We develop a rigorous theoretical frame-work for quantum-resilient zero-trust architectures (ZTA) tailored to these environments. Our contributions encompass: (i) security reductions demonstrating that ZTA derives quantum resistance from lattice-based hardness assumptions; (ii) precise complexity analyses establishing Θ(log n) as the tight communication bound for n-node networks; (iii) fundamental tradeoffs between differential privacy and anomaly detection utility; and (iv) impossibility theorems delineating limits under quantum adversaries. Our work is the first to provide tight complexity bounds and impossibility theorems for quantum-resilient ZTA in edge networks.
Abstract Quantum computing promises unprecedented computational power, posing fundamental threats and offering novel solutions to modern cryptography and cybersecurity. This survey paper reviews the rapidly evolving landscape of quantum-resistant and quantum-native security protocols. By analyzing foundational computational security models and the unique vulnerabilities introduced by quantum algorithms, this work proposes a structured evaluation framework for assessing the robustness of cryptographic systems. Ultimately, this survey highlights the critical transition from classical cryptographic infrastructures to quantum-secure paradigms, ensuring data confidentiality and integrity in the post-quantum era. Keywords: Quantum Computing, Security Protocol, Vulnerabilities 1.Introduction The emergence of quantum computing represents a paradigm shift in both computational physics and information technology. Quantum algorithms, particularly Shor's and Grover's algorithms, inherently challenge the mathematical foundations of classical public-key cryptography. As a result, securing communication channels against quantum-empowered adversaries has become an urgent priority for global infrastructure and national security. The motivation for this survey stems from the immediate need to bridge the gap between theoretical quantum mechanics and applied cybersecurity, ensuring that secure communications can withstand the computational leaps expected in the next decade. The core problem addressed in this paper is the comprehensive evaluation of security protocols under the threat model of a fully scalable quantum computer. The scope encompasses both post-quantum cryptographic (PQC) protocols and inherently quantum protocols, such as those relying on physical quantum states for key distribution. Existing classical approaches are insufficient for two main reasons. First, classical computational security models often rely on mathematical hardness assumptions (like integer factorization) that are rapidly undermined by theoretical quantum algorithms. Second, current software tools for designing secure classical protocols fail to account for quantum state phenomena, such as superposition and entanglement, rendering classical verification methods inadequate for quantum threat models. To address these structural challenges, this paper presents the following contributions: We provide a comprehensive taxonomy of vulnerabilities in both classical and quantum security protocols, mapping specific algorithmic advantages to protocol failure points. We propose a structured, multi-module framework for simulating, attacking, and verifying the security of hybrid quantum-classical cryptographic architectures. 2.Foundations of Classical Protocol Analysis The rigorous analysis of security protocols has traditionally relied on well-defined computational and symbolic models (Toorani, 2016). Researchers have extensively mapped out the taxonomy of attacks on authenticated key exchange (AKE) protocols and password-authenticated key exchange (PAKE) systems, establishing the mathematical groundwork for secure communication. The core idea of these foundational works is to establish provable security bounds that distinguish between information-theoretic and computational security. While this traditional paradigm offers strong mathematical guarantees against classical adversaries, its primary weakness is the failure to incorporate quantum attack vectors into the adversary's capability profile. Our work builds upon these classical models by explicitly injecting quantum algorithmic capabilities into standard protocol verification routines. 2.1.Quantum Algorithm Development and Simulation A significant body of literature focuses on the theoretical development and computational simulation of quantum algorithms capable of compromising or enhancing network security. Academic overviews have formalized algorithms like Grover's and Shor's, demonstrating their theoretical efficiency over classical counterparts in breaking cryptographic primitives. Furthermore, researchers have developed advanced design automation tools, such as decision diagrams, to simulate and verify complex quantum circuits. The strength of these simulation tools lies in their ability to model complex quantum states without requiring expensive physical hardware. However, a notable weakness is that they often abstract away the physical noise and hardware constraints that exist in real-world cryptographic deployments. This survey contextualizes these simulation techniques specifically within the framework of adversarial security testing, bridging theoretical algorithms with practical protocol defense. 3.Physical Implementations and Hardware Considerations Beyond algorithmic theory, the physical realization of quantum states directly impacts the practical security of any quantum protocol. Research into cavity quantum electrodynamics (QED) has demonstrated the complete mathematical construction of fundamental quantum gates, such as the controlled-controlled NOT gate, operating in the weak coupling regime (Fujii et al., 2005). Additionally, methods like Quantum Computed Moments (QCM) address the hardware constraints and noise typical of Near-Term Intermediate Scale Quantum (NISQ) devices, estimating ground state properties even with suboptimal trial states. The strength of this hardware-focused research is its realism regarding current technological limits; however, it often lacks a direct bridge to high-level network protocol verification. Compared to these purely physical studies, our survey integrates physical noise models into a generalized, software-driven protocol verification framework. 4.Approach To systematically evaluate quantum computing security protocols, we propose a structured Quantum Protocol Verification Framework (QPVF). The first module is the "Threat Modeling Engine," which defines the adversary's capabilities, ranging from classical data interception to full quantum memory manipulation. The second module is the "Quantum Circuit Synthesizer," which leverages decision diagram-based tools to translate high-level cryptographic operations into verifiable quantum circuits. The final module is the "Vulnerability Analyzer," which subjects the synthesized circuits to simulated quantum attacks, effectively distinguishing between idealized computational security and realistic hardware-constrained security. This modular pipeline allows security engineers to isolate specific vulnerabilities at both the abstract algorithmic layer and the simulated physical implementation layer. A key design choice in the QPVF is the utilization of decision diagrams for circuit simulation. This choice is predicated on the fact that decision diagrams efficiently handle the exponential state space of quantum systems during complex verification tasks (Wille et al., 2021). Furthermore, our framework explicitly incorporates noise models derived from current NISQ hardware limitations, ensuring that the security evaluation reflects realistic physical constraints rather than purely idealized environments (Vallury & Hollenberg, 2023). To evaluate this framework, we propose a hypothetical benchmarking plan using an artificially generated dataset of 10,000 hybrid quantum-classical cryptographic key exchanges. We will measure the success rate of simulated Grover-based brute-force attacks against varying key sizes and simulated environmental noise levels. This evaluation will compare the theoretical vulnerability threshold of a protocol against the practical threshold observed when quantum noise severely degrades the adversary's computational capabilities. The operational flow of the QPVF is designed to provide end-to-end security verification for next-generation networks. It bridges the critical gap between abstract protocol design and simulated hardware execution. The methodology can be summarized by the following numbered pipeline: Protocol Ingestion: The classical or quantum protocol is parsed into a standardized symbolic representation. Adversary Assignment: The user assigns a precise computational profile, selecting between traditional classical algorithms or advanced quantum capabilities. Circuit Generation: Protocol steps are mapped to equivalent quantum decision diagrams for scalable software simulation. Execution & Attack: Simulated quantum algorithms are executed against the mapped circuits to test for cryptographic resilience. Output Generation: The system outputs a vulnerability score and highlights specific failure points caused by either algorithmic weaknesses or simulated hardware noise. 5.Discussion The transition to quantum-secure protocols carries profound practical implications for global information infrastructure and enterprise deployment. Deploying these advanced protocols requires immense updates to existing software toolkits, as current digital systems are not fundamentally designed to handle the complexity of quantum states. Furthermore, organizations must consider the massive educational and workforce development efforts needed to train software engineers in quantum cryptography, a requirement already highlighted by international hackathons and educational initiatives. Integrating quantum-resistant protocols into complex domains like high-energy physics networks or global banking systems will require bridging the gap between theoretical quantum mechanics and applied computer engineering. Consequently, practical deployment must occur in hybrid phases, maintaining classical cryptographic wrappers while dedicated quantum infrastructure matures. Despite the robust theoretical design of proposed quantum security frameworks, several limitations and failure modes persist in practical applications. First, physical implementation attacks, such as side-channel attacks on the lasers and cavities used in physical quantum gates can bypass theoretical software security guarant
The rapid advancement of quantum computing introduces new risks to conventional cryptographic mechanisms that safeguard digital communication. To counteract these emerging threats, Post-Quantum Cryptography (PQC) offers algorithms designed to remain secure even in the presence of quantum-capable adversaries. Simultaneously, Zero-Trust Network (ZTN) principles, which operate on the concept of continuous verification and minimal trust, have become essential for modern cybersecurity strategies. This study explores the integration of PQC techniques into ZTN frameworks to establish a resilient foundation for protecting future communication infrastructures against both classical and quantum-based attacks. This paper presents a comprehensive review of PQC algorithms, analyses their applicability in ZTN environments, and examines implementation challenges and performance considerations. The study also outlines future directions for research in secure quantum-resistant network architectures.
Abstract: This study advances a unifying systems perspective on quantum-safe network security by synthesizing recent progress in quantum cryptography with practical integration patterns across carrier-grade infrastructures. Concept analysis distinguishes the roles of quantum key distribution (QKD), device-independent variants, quantum authentication, and post-quantum cryptography (PQC) within zero-trust architectures. Building on this, a layered framework—spanning physical/entanglement resources, key management, crypto-agility, control plane orchestration, and policy/compliance—is articulated to support end-to-end, composable guarantees. The problem addressed is the realization of verifiable, quantum-resilient security under operational constraints involving latency, key-rate variability, and heterogeneous trust assumptions. Methodology combines a structured literature synthesis with formal composability mapping to universal composability principles, adversarial threat modeling for quantum-enabled attackers, and testbed/simulation evaluation of hybrid QKD–PQC pipelines across L2–L3 segments and 5G/6G backhaul scenarios. Key results indicate that (i) selective QKD deployment on high-value links coupled with PQC at endpoints enhances resilience while preserving crypto-agility; (ii) automated key-lifecycle orchestration reduces exposure windows; and (iii) device-independent assurances strengthen guarantees where trust relaxation is necessary. The impact is a deployment-ready reference architecture, measurable integration metrics, and guidance aligned with emerging standards for critical infrastructure and national networks. The implications extend to procurement, compliance, and roadmap planning for quantum-era network security. Keywords: quantum-safe cryptography, quantum key distribution (QKD), post-quantum cryptography (PQC), hybrid QKD–PQC, composable security, device-independent QKD, zero-trust networks, key management and orchestration, 5G/6G backhaul, network security architecture, standards and interoperability
This paper explores the design and theoretical foundations of quantum key distribution (QKD) protocols engineered for device-independent security. The core argument presented is that achieving unconditional security in QKD is possible without relying on the assumption of perfect hardware, a limitation inherent in many existing protocols. We propose a framework leveraging Bell inequality violations to establish secure key exchange, offering a fundamentally different approach compared to traditional protocols. This approach aims to mitigate the risks associated with side-channel attacks and device imperfections. The protocol outlined here represents a significant step towards realizing truly robust and secure quantum communication systems, offering a pathway for building cryptographic infrastructure resilient to evolving threats. The key contributions lie in the theoretical rigor applied to device independence and the utilization of Bell tests as a core mechanism for establishing security. The presented model offers a starting point for future research and development in this critical area of quantum cryptography.
Today’s Industrial Internet of Things (IIoT) suffers from millions of classical cyber-attacks annually, including insider, outsider, Denial of Service (DoS) and eavesdropping attacks. Several proofs establish that Quantum Key Distribution (QKD) networks achieve unconditional security guaranteed by the laws of physics in theory. These proofs assume ideal QKD nodes with zero information leakage exist, which implies immunity to classical cyber-attacks that leak information. In contrast, many security agencies state that QKD is vulnerable to classical cyber-attacks, creating a Quantum Security Paradox between theory and practice. It is shown that: (i) Existing proofs of QKD’s unconditional security do not hold in practice, since the assumption of zero information leakage in the classical network is not met; and (ii) Real QKD networks are vulnerable to classical insider attacks and backdoors, which leak information. Global-scale Space-Ground QKD networks will integrate micro-satellites in space with ground-stations on earth. A new vulnerability is presented. These QKD networks are vulnerable to classical backdoors and global surveillance, wherein millions of secret QKD keys may be exposed. Unconditional-security requires complimentary methods to ensure zero information leakage in the classical network. A Quantum-Safe Deterministic IIoT (Det-IIoT) network that exploits SDN (Software Defined Networking), Artificial Intelligence (AI) and a Zero Trust Architecture (ZTA) access control system (ACS) is explored. The ZTA-ACS supports programmable deterministic classical communications between authorized QKD nodes or applications, and blocks communications from cyber-attackers. The Det-IIoT can be placed within satellites to strengthen Space-Ground QKD, by mitigating classical cyber-attacks that leak information.