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.
| Original language | English |
|---|---|
| Title of host publication | 2011 IEEE International Symposium on Information Theory Proceedings |
| Publisher | IEEE |
| Pages | 978-982 |
| ISBN (Electronic) | 978-1-4577-0595-3, 978-1-4577-0594-6 |
| ISBN (Print) | 978-1-4577-0596-0 |
| DOIs | |
| Publication status | Published - Jul 2011 |
| Externally published | Yes |
| Event | 2011 IEEE International Symposium on Information Theory Proceedings (ISIT 2011) - Park Inn Pribaltiyskaya, St. Petersburg, Russian Federation Duration: 31 Jul 2011 → 5 Aug 2011 |
Conference
| Conference | 2011 IEEE International Symposium on Information Theory Proceedings (ISIT 2011) |
|---|---|
| Place | Russian Federation |
| City | St. Petersburg |
| Period | 31/07/11 → 5/08/11 |
Fingerprint
Dive into the research topics of 'The hidden flow of information'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver