Wiretap Secret Key Agreement Via Secure Omniscience
Praneeth Kumar Vippathalla, Chung Chan, Navin Kashyap, Qiaoqiao, Zhou

TL;DR
This paper investigates the relationship between secret key agreement and secure omniscience in multiterminal source models with wiretappers, establishing duality results for certain linear models and exploring conditions where this duality holds or fails.
Contribution
It identifies classes of sources where secure omniscience and secret key agreement duality holds, especially in linear models, and discusses conditions where the duality breaks down.
Findings
Duality holds for certain finite linear source models.
Duality is achieved when the wiretap secret key capacity is attained by a perfect linear scheme.
Counterexamples show duality may not hold in non-linear or limited communication scenarios.
Abstract
In this paper, we explore the connection between secret key agreement and secure omniscience within the setting of the multiterminal source model with a wiretapper who has side information. While the secret key agreement problem considers the generation of a maximum-rate secret key through public discussion, the secure omniscience problem is concerned with communication protocols for omniscience that minimize the rate of information leakage to the wiretapper. The starting point of our work is a lower bound on the minimum leakage rate for omniscience, , in terms of the wiretap secret key capacity, . Our interest is in identifying broad classes of sources for which this lower bound is met with equality, in which case we say that there is a duality between secure omniscience and secret key agreement. We show that this duality holds in the…
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.
Taxonomy
TopicsWireless Communication Security Techniques · Cellular Automata and Applications · Cooperative Communication and Network Coding
