Track papers across labs, topics, and trends.
Search papers, labs, and topics across Lattice.
This paper introduces a path validation protocol for QKD networks that allows receivers to verify network operator compliance with pre-agreed policies, such as the use of certified devices and disjoint transmission paths. The protocol achieves this validation without revealing sensitive network topology information to the users, thus preserving operator confidentiality. The authors provide a formal model, a provably secure construction, and a concrete instantiation, demonstrating its efficiency with a computational cost of 1-2.5s and a communication overhead of less than 70kB for a 100-node network.
Now, QKD network operators can prove they're following the rules without revealing their secret network maps.
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.