Abstract
We consider the network consisting of three nodes 1, 2, 3 connected by two open channels 1→2 and 1→3. The information present in the node 1 consists of four strings x,y,z,w. The nodes 2, 3 know x,w and need to know y,z, respectively. We want to arrange transmission of information over the channels so that both nodes 2 and 3 learn what they need and the disclosure of information is as small as possible. By information disclosure we mean the amount of information in the strings transmitted through channels about x,y,z,w (or about x,w). We are also interested in whether it is possible to minimize the disclosure of information and simultaneously minimize the length of words transferred through the channels.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: 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.
