On the Optimality of Secret Key Agreement via Omniscience
From MaRDI portal
Publication:4569189
DOI10.1109/TIT.2018.2802546zbMATH Open1390.94830arXiv1702.07429OpenAlexW2963799121MaRDI QIDQ4569189FDOQ4569189
Authors: Chung Chan, Manuj Mukherjee, N. Kashyap, Qiaoqiao Zhou
Publication date: 27 June 2018
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Abstract: For the multiterminal secret key agreement problem under a private source model, it is known that the maximum key rate, i.e., the secrecy capacity, can be achieved through communication for omniscience, but the omniscience strategy can be strictly suboptimal in terms of minimizing the public discussion rate. While a single-letter characterization is not known for the minimum discussion rate needed for achieving the secrecy capacity, we derive single-letter lower and upper bounds that yield some simple conditions for omniscience to be discussion-rate optimal. These conditions turn out to be enough to deduce the optimality of omniscience for a large class of sources including the hypergraphical sources. Through conjectures and examples, we explore other source models to which our methods do not easily extend.
Full work available at URL: https://arxiv.org/abs/1702.07429
Recommendations
- scientific article; zbMATH DE number 1759326
- Key-independent optimality
- Unconditionally secure key agreement and the intrinsic conditional information
- A bound for multiparty secret key agreement and implications for a problem of secure computing
- On the Communication Complexity of Key-Agreement Protocols.
- Almost Optimum Secret Sharing Schemes Secure Against Cheating for Arbitrary Secret Distribution
- Secret Key Agreement: General Capacity and Second-Order Asymptotics
- Communication complexity of the secret key agreement in algorithmic information theory
- Information-theoretic key agreement: from weak to strong secret for free
Cited In (2)
This page was built for publication: On the Optimality of Secret Key Agreement via Omniscience
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4569189)