The hidden flow of information
Author:
- 1 July 2011
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 21578095,p. 978-982
Abstract
An information identity is proven, equating the secrecy capacity of the multiterminal secret key agreement problem and the throughput of certain undirected network. As a consequence, network coding can be used for secret key agreement while secrecy capacity characterizes the network throughput. A meaningful notion of mutual dependence is established with the combinatorial interpretation of partition connectivity.Keywords
This publication has 5 references indexed in Scilit:
- Mutual dependence for secret key agreement2010
- Network Coding for Undirected Information ExchangeIEEE Communications Letters, 2009
- Secrecy Capacities for Multiple TerminalsIEEE Transactions on Information Theory, 2004
- On decomposing a hypergraph into k connected sub-hypergraphsDiscrete Applied Mathematics, 2003
- Polymatroidal dependence structure of a set of random variablesInformation and Control, 1978