• DocumentCode
    729548
  • Title

    Successive omniscience

  • Author

    Chung Chan ; Al-Bashabsheh, Ali ; Ebrahimi, Javad B. ; Kaced, Tarik ; Kadhe, Swanand ; Tie Liu ; Sprintson, Alex ; Muxi Yan ; Qiaoqiao Zhou

  • Author_Institution
    Inst. of Network Coding, Chinese Univ. of Hong Kong, Hong Kong, China
  • fYear
    2015
  • fDate
    22-24 June 2015
  • Firstpage
    21
  • Lastpage
    25
  • Abstract
    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.
  • Keywords
    private key cryptography; distributed storage system; message exchange; secret key agreement; successive omniscience; Correlation; IP networks; Mutual information; Network coding; Servers; Zinc; Successive omniscience; data storage; multivariate mutual information; secret key agreement;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Network Coding (NetCod), 2015 International Symposium on
  • Conference_Location
    Sydney, NSW
  • Type

    conf

  • DOI
    10.1109/NETCOD.2015.7176782
  • Filename
    7176782