← 研踪 PaperTrailarXiv:2611.16776 · v1
Key Relay and Secure Network Coding: One-Shot Equivalence and Separation on Undirected Networks
首次提交 2026-11-12 21:20
版本更新 2026-11-12 21:20
雷达观测 2026-11-13 14:15
摘要
Motivated by quantum key distribution networks, we compare key relay protocols with secure network coding on the same undirected graph. In this comparison, we fix the finite field, terminal set, and wiretap family. Each edge supplies one independent uniform symbol to its endpoints for key relay, or carries one symbol once for network coding. The network code may choose its source terminal, edge orientations, and causal transmission order before execution. In this setting, the standard one-time-pad simulation readily converts every secure network code to key relay. We investigate the reverse conversion to linear network coding. For two terminals and a one-symbol key, arbitrary key relay is equivalent to scalar linear acyclic network coding over the prescribed field. The proof uses connectivity and flow conservation, related to the binary -flow protocol. However, this equivalence fails in general when several terminals seek one common key. A doubled triangle separates key relay from acyclic coding but admits causal coding on a cyclic orientation. On the four-terminal complete graph, a linear key relay protocol over the ternary field withstands the three perfect-matching wiretap sets, whereas no linear causal network code distributes a source symbol of the same size, even with private randomness at every vertex and its use in decoding. We also establish a linear key relay normal form that removes interaction and private randomness and bounds public communication. All results concern one-shot feasibility with exact agreement and perfect secrecy.
作者备注：36 pages, 5 figures
观测到的版本
相邻记录可能跳过中间版本；首次发现 v2 及以上也会标为版本更新。
v1 · 2026-11-12 21:20 · 最新观测版本
Key Relay and Secure Network Coding: One-Shot Equivalence and Separation on Undirected Networks
Motivated by quantum key distribution networks, we compare key relay protocols with secure network coding on the same undirected graph. In this comparison, we fix the finite field, terminal set, and wiretap family. Each edge supplies one independent uniform symbol to its endpoints for key relay, or carries one symbol once for network coding. The network code may choose its source terminal, edge orientations, and causal transmission order before execution. In this setting, the standard one-time-pad simulation readily converts every secure network code to key relay. We investigate the reverse conversion to linear network coding. For two terminals and a one-symbol key, arbitrary key relay is equivalent to scalar linear acyclic network coding over the prescribed field. The proof uses connectivity and flow conservation, related to the binary -flow protocol. However, this equivalence fails in general when several terminals seek one common key. A doubled triangle separates key relay from acyclic coding but admits causal coding on a cyclic orientation. On the four-terminal complete graph, a linear key relay protocol over the ternary field withstands the three perfect-matching wiretap sets, whereas no linear causal network code distributes a source symbol of the same size, even with private randomness at every vertex and its use in decoding. We also establish a linear key relay normal form that removes interaction and private randomness and bounds public communication. All results concern one-shot feasibility with exact agreement and perfect secrecy.
查看此版本解读 →查看此版本原文 ↗