Data Exchange Problem with Helpers
Nebojsa Milosavljevic, Sameer Pawar, Salim El Rouayheb, Michael, Gastpar, Kannan Ramchandran

TL;DR
This paper presents a polynomial-time algorithm for efficient data exchange among users with partial file knowledge, aided by helpers, and extends to secret key generation under various side-information models.
Contribution
It introduces a deterministic polynomial-time algorithm for optimal data exchange with helpers and constructs secret keys in multi-terminal settings.
Findings
Algorithm achieves minimal total communication cost.
Explicit optimal transmission schemes for specific side-information models.
Polynomial-time solution for secret key construction in multi-terminal scenarios.
Abstract
In this paper we construct a deterministic polynomial time algorithm for the problem where a set of users is interested in gaining access to a common file, but where each has only partial knowledge of the file. We further assume the existence of another set of terminals in the system, called helpers, who are not interested in the common file, but who are willing to help the users. Given that the collective information of all the terminals is sufficient to allow recovery of the entire file, the goal is to minimize the (weighted) sum of bits that these terminals need to exchange over a noiseless public channel in order achieve this goal. Based on established connections to the multi-terminal secrecy problem, our algorithm also implies a polynomial-time method for constructing the largest shared secret key in the presence of an eavesdropper. We consider the following side-information…
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
TopicsCryptography and Data Security · Wireless Communication Security Techniques · Privacy-Preserving Technologies in Data
