Incremental and decremental secret key agreement

We study the rate of change of the multivariate mutual information among a set of random variables when some common randomness is added to or removed from a subset. This is formulated more precisely as two new multiterminal secret key agreement problems which ask how one can increase the secrecy cap...

Full description

Saved in:
Bibliographic Details
Published in2016 IEEE International Symposium on Information Theory (ISIT) pp. 2514 - 2518
Main Authors Chan, Chung, Al-Bashabsheh, Ali, Zhou, Qiaoqiao
Format Conference Proceeding Journal Article
LanguageEnglish
Published IEEE 01.07.2016
Subjects
Combinatorial analysis
Entropy
Information theory
IP networks
multivariate mutual information
Mutual information
Network coding
principal sequence of partitions
Random variables
Randomness
Redundant
Resource management
secret key agreement
Online AccessGet full text

Cover

More Information
Summary:We study the rate of change of the multivariate mutual information among a set of random variables when some common randomness is added to or removed from a subset. This is formulated more precisely as two new multiterminal secret key agreement problems which ask how one can increase the secrecy capacity efficiently by adding common randomness to a small subset of users, and how one can simplify the source model by removing redundant common randomness that does not contribute to the secrecy capacity. The combinatorial structure has been clarified along with some meaningful open problems.
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Conference-1
ObjectType-Feature-3
content type line 23
SourceType-Conference Papers & Proceedings-2
ISSN:2157-8117
DOI:10.1109/ISIT.2016.7541752