Abstract
In this paper we consider the problem of generating arbitrary three-party correlations from a combination of public and secret correlations. Two parties -- called Alice and Bob -- share perfectly correlated bits that are secret from a collaborating third party, Charlie. At the same time, all three parties have access to a separate source of correlated bits, and their goal is to convert these two resources into multiple copies of some given tripartite distribution $P_{XYZ}$. We obtain a single-letter characterization of the trade-off between public and private bits that are needed to achieve this task. The rate of private bits is shown to generalize Wyner's classic notion of common information held between a pair of random variables. The problem we consider is also closely related to the task of secrecy formation in which $P_{XYZ}$ is generated using public communication and local randomness but with Charlie functioning as an adversary instead of a collaborator. We describe in detail the differences between the collaborative and adversarial scenarios.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.