A Caltech Library Service

Network Coding Multicast Key-Capacity

Langberg, Michael and Effros, Michelle (2022) Network Coding Multicast Key-Capacity. . (Unpublished)

[img] PDF - Submitted Version
See Usage Policy.


Use this Persistent URL to link to this item:


For a multi-source multi-terminal noiseless network, the key-dissemination problem involves the task of multicasting a secret key K from the network sources to its terminals. As in secure multicast network-coding, in the key-dissemination problem the source nodes have access to independent randomness and, as the network is noiseless, the resulting key K is a function of the sources' information. However, different from traditional forms of multicast, in key-dissemination the key K need not consist of source messages, but rather may be any function of the information generated at the sources, as long as it is shared by all terminals. Allowing the shared key K to be a mixture of source information grants a flexibility to the communication process which gives rise to the potential of increased key-rates when compared to traditional secure multicast. The multicast key-capacity is the supremum of achievable key-rates, subject to the security requirement that the shared key is not revealed to an eavesdropper with predefined eavesdropping capabilities. The key-dissemination problem (termed also, secret key-agreement) has seen significant studies over the past decades in memoryless network structures. In this work, we initiate the study of key-dissemination in the context of noiseless networks, i.e., network coding. In this context, we study similarities and differences between traditional secure-multicast and the more lenient task of key-dissemination.

Item Type:Report or Paper (Discussion Paper)
Related URLs:
URLURL TypeDescription Paper
Langberg, Michael0000-0002-7470-0718
Effros, Michelle0000-0003-3757-0675
Additional Information:This work is supported in part by NSF grants CCF-1817241 and CCF-1909451.
Funding AgencyGrant Number
Record Number:CaltechAUTHORS:20220804-201325308
Persistent URL:
Usage Policy:No commercial reproduction, distribution, display or performance rights in this work are provided.
ID Code:116136
Deposited By: George Porter
Deposited On:11 Aug 2022 22:46
Last Modified:11 Aug 2022 22:46

Repository Staff Only: item control page