Abstract
A mutual dependence expression is established for the secret key agreement problem when all users are active. In certain source networks, the expression can be interpreted as certain notions of connectivity and network information flow. In particular, the secrecy problem can be mapped to a new class of network coding problems with selectable links and undirected broadcast links. For such networks, the secrecy capacities serve as upper bounds on the maximum network throughputs, while the network coding solutions can be used for secret key agreement.
| Original language | English |
|---|---|
| Title of host publication | 2010 44th Annual Conference on Information Sciences and Systems (CISS) |
| Publisher | IEEE |
| ISBN (Electronic) | 978-1-4244-7417-2 |
| ISBN (Print) | 978-1-4244-7416-5 |
| DOIs | |
| Publication status | Published - 2010 |
| Externally published | Yes |
| Event | 2010 44th Annual Conference on Information Sciences and Systems (CISS) - Princeton University, Princeton, United States Duration: 17 Mar 2010 → 19 Mar 2010 https://www.ieee.org/conferences_events/conferences/conferencedetails/index.html?Conf_ID=17287 |
Publication series
| Name | Annual Conference on Information Sciences and Systems (CISS) |
|---|---|
| Publisher | IEEE |
Conference
| Conference | 2010 44th Annual Conference on Information Sciences and Systems (CISS) |
|---|---|
| Place | United States |
| City | Princeton |
| Period | 17/03/10 → 19/03/10 |
| Internet address |
Research Keywords
- Mutual dependence
- Network coding
- Partition connectivity
- Secret key agreement
- Supermodularity
Fingerprint
Dive into the research topics of 'Mutual Dependence for Secret Key Agreement'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver