Mutual Dependence for Secret Key Agreement
Name
Chan-2010-Mutual Dependence.pdf
Size
421.05 KB
Format
Adobe PDF
Checksum (MD5)
7f55156e4aee3dd40d337bb3f1932aec
Author(s)
Chan, Chung
Zheng, Lizhong
Date Issued
May 2010
Journal
44th Annual Conference on Information Sciences and Systems (CISS), 2010
Publisher
Institute of Electrical and Electronics Engineers
Citation
Chung Chan, and Lizhong Zheng. “Mutual dependence for secret key agreement.” IEEE, 2010. 1-6. Web. 28 Oct. 2011. © 2010 Institute of Electrical and Electronics Engineers
Version
Final published version
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.
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Massachusetts Institute of Technology. Research Laboratory of Electronics
Terms of Use
Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1109/CISS.2010.5464805
