2010 · 80 citations · 9 references
EngineeringCommunicationComputer ScienceComputer NetworksDigital CommunicationInformation TheoryChannel CodingCoding TheoryCommunication NetworksInformation-theoretic CryptographyMutual InformationNetwork Information TheoryInformation Flow GraphsKey AgreementMutual DependenceMutual DependencyMutual Key AgreementSecrecy PropertiesSecret Key AgreementUpper Bounds
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.
9
An algebraic approach to network coding
R. Koetter, Muriel Médard · IEEE/ACM Transactions on Networking · 2003 · 2.4K citations
Network Coding in Undirected Networks
Zongpeng Li, Baochun Li · 2004 · 149 citations