Mutual dependence for secret key agreement
Mutual dependence for secret key agreement
复制标题
DOI：
10.1109/ciss.2010.5464805
复制
发表时间：
2010-03
期刊：
影响因子：
--
通讯作者：
Chung Chan;Lizhong Zheng
中科院分区：
文献类型：
--
作者：
Chung Chan;Lizhong Zheng
当所有用户处于活动状态时，为秘密密钥协议问题建立了相互依赖的表达。在某些源网络中，可以将表达式解释为某些连接性和网络信息流的概念。特别是，可以将保密问题映射到具有可选链接和无向广播链接的新的网络编码问题。对于此类网络，保密能力是最大网络吞吐量上的上限，而网络编码解决方案可用于秘密密钥协议。
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.