2015 · 18 citations · 11 references
ComputingComputer ScienceComputer SystemsDistributed SystemsInformation TheoryStorage SystemsData RedundancyDistributed ComputingDistributed StorageExchange Of InformationInformation SharingMutual InformationCommunal StorageMultivariate EntropyMultivariate Mutual InformationMutual Information AnalysisMutual Information Estimation
The problem of successive omniscience is formulated for the study of a recently proposed multivariate mutual information measure. In this problem, a set of users want to achieve omniscience, i.e., recover the private sources of each other by exchanging messages. However, the omniscience is achieved in a successive manner such that local subgroups of users can first achieve local omniscience, i.e., recover the private sources of other users in the same subgroups. Global omniscience among all users is achieved by an additional exchange of messages. This formulation can be motivated by a distributed storage system that enables file sharing among groups of users. It is shown that the multivariate mutual information can be used to characterize the minimum storage required as well as the conditions under which local omniscience can be achieved for free without increasing the total communication rate required for global omniscience. Our results provide new interpretations of the multivariate mutual information.
11
Multivariate Mutual Information Inspired by Secret-Key Agreement
Chung Chan, Ali Al-Bashabsheh, Javad B. Ebrahimi et al. · Proceedings of the IEEE · 2015 · 86 citations
Mutual dependence for secret key agreement
Chung Chan, Lizhong Zheng · 2010 · 80 citations · Full text
Group Secret Key Generation Algorithms
Chunxuan Ye, Alex Reznik · 2007 · 69 citations