Problem
Research questions and friction points this paper is trying to address.
Quantum Key Distribution
Path Validation
Topology Hiding
Network Security
Trusted Repeater Nodes
Topology-Hiding Path Validation for Large-Scale Quantum Key Distribution Networks
🤖 AI Summary
This work addresses the critical challenge of path verification in large-scale quantum key distribution (QKD) networks, where existing methods risk exposing sensitive topological information. We propose the first path verification protocol that simultaneously ensures compliance with security policies—such as device authentication and path disjointness—and preserves network topology privacy. Leveraging formal cryptographic modeling, we construct a provably secure, general-purpose scheme and demonstrate its practicality through an efficient instantiation in a long-distance, 100-node network setting. The implementation incurs only 1–2.5 seconds of computational overhead and less than 70 kB of communication cost, achieving a strong balance between rigorous security guarantees and real-world efficiency.
📝 Abstract
Secure long-distance communication in quantum key distribution (QKD) networks depends on trusted repeater nodes along the entire transmission path. Consequently, these nodes will be subject to strict auditing and certification in future large-scale QKD deployments. However, trust must also extend to the network operator, who is responsible for fulfilling contractual obligations -- such as ensuring certified devices are used and transmission paths remain disjoint where required. In this work, we present a path validation protocol specifically designed for QKD networks. It enables the receiver to verify compliance with agreed-upon policies. At the same time, the protocol preserves the operator's confidentiality by ensuring that no sensitive information about the network topology is revealed to users. We provide a formal model and a provably secure generic construction of the protocol, along with a concrete instantiation. For long-distance communication involving 100 nodes, the protocol has a computational cost of 1-2.5s depending on the machine, and a communication overhead of less than 70kB - demonstrating the efficiency of our approach.
Innovation
Methods, ideas, or system contributions that make the work stand out.
topology-hiding
path validation
quantum key distribution
secure multi-party computation
network confidentiality
🔎 Similar Papers
No similar papers found.
