Secure multiple key-cast achieves rate d-ℓ against ℓ node eavesdroppers in d-vertex-connected networks, with extensions to partial connectivity and multi-source cases.
Random linear network coding: A free cipher? InIEEE International Symposium on Information Theory, pages 546–550
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.IT 1years
2026 1verdicts
UNVERDICTED 1roles
background 1polarities
background 1representative citing papers
citing papers explorer
-
Secure (Multiple) Key-Cast over Networks: Multiple Eavesdropping Nodes
Secure multiple key-cast achieves rate d-ℓ against ℓ node eavesdroppers in d-vertex-connected networks, with extensions to partial connectivity and multi-source cases.