Secure (Multiple) Key-Cast over Networks: Multiple Eavesdropping Nodes
Reza Sayyari, Michael Langberg

TL;DR
This paper investigates secure multiple key distribution over networks with eavesdroppers, establishing achievable rates and optimality for various network connectivity scenarios, including multi-source settings.
Contribution
It introduces new coding schemes and capacity bounds for secure key-cast in networks with different connectivity structures and eavesdropper capabilities.
Findings
Achievable secure key rate of d - ℓ in d-vertex-connected networks.
Optimality of the rate by matching upper bounds.
Secure key-cast remains feasible with partially-connected nodes and multi-source eavesdroppers.
Abstract
We study the secure multiple key-cast problem over noiseless networks under node-based eavesdroppers, where one or more source nodes participate in the generation of distinct secret keys to be shared among designated terminal subsets, while an eavesdropper observing up to nodes, including possibly source nodes, obtains no information about the keys. For the single-source setting, we first consider networks in which every node is -vertex connected from the source. We show that a secure key rate of is achievable for all such networks. We further show that this rate is optimal by exhibiting -vertex-connected networks whose secure key-cast capacity is at most . We next study networks in which only the terminal nodes are -vertex connected from the source, while other network nodes may not satisfy this connectivity condition and may be partially-connected. We…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
