科研速览 · Science Skim继续刷下去 · Keep skimming →
◆ Entropy2026-06-16· Quantum key distribution

Topology-Oblivious Random-Walk Key Relaying in Quantum Key Distribution Networks

Krišjānis Petručeņa, Sergejs Kozlovičs, Juris Vīksna, Elīna Kalniņa, Reinis Isaks, Edgars Celms, Lelde Lāce, Edgars Rencis

原始摘要(英文原文)· Original abstract
Quantum key distribution (QKD) networks require relaying when distant key management entities share no direct quantum link. Most relay strategies, however, rely on centralized control or globally maintained routing state. This paper asks whether useful security and efficiency can still be obtained with topology-oblivious stochastic forwarding. It studies the security-overhead trade-off in a model in which fragmented key material is relayed via random-walk variants and reconstructed under privacy amplification. The analysis asks whether strictly local forwarding can retain useful information-theoretic security (ITS). Evaluation on the GÉANT topology, representing a European academic backbone network, shows clear differences between random-walk variants. The proposed highest-score-neighbor local path-diversification heuristic reduces the probability that relayed key material passes through a compromised node. The evaluation also shows that scouting-based loop erasure significantly shortens sampled routes and improves throughput in the model. Against one- to three-node cartels, random flow protects slightly more source-target pairs than a static disjoint-multipath method on the evaluated topologies. These findings position topology-oblivious stochastic forwarding as a simpler decentralized design for QKD relaying without centralized orchestration or gossip protocols.
读原文 · Read the paper ↗

AI 追问PRO

登录后使用 AI 追问

讨论区

登录后参与讨论

相关论文 · Related

Topology-Oblivious Random-Walk Key Relaying in Quantum Key Distribution Networks — 科研速览 Science Skim