Successive Omniscience

Research output: Journal Publications and Reviews (RGC: 21, 22, 62)21_Publication in refereed journalpeer-review

19 Scopus Citations
View graph of relations

Author(s)

  • Ali Al-Bashabsheh
  • Qiaoqiao Zhou
  • Ni Ding
  • Tie Liu
  • Alex Sprintson

Detail(s)

Original languageEnglish
Pages (from-to)3270-3289
Journal / PublicationIEEE Transactions on Information Theory
Volume62
Issue number6
Online published21 Apr 2016
Publication statusPublished - Jun 2016
Externally publishedYes

Abstract

Because the exchange of information among all the users in a large network can take a long time, a successive omniscience protocol is proposed. Namely, subgroups of users first recover the information of other users in the same subgroup at an earlier stage called local omniscience. Then, the users recover the information of all other users at a later stage called global omniscience. To facilitate the information exchange, a distributed storage system is used, so that users can conveniently upload and download messages through some reliable central servers. The minimum upload bandwidth is characterized and a bandwidth-storage trade-off is discovered. The results reveal the new connections to the problem of secret key agreement and, consequently, provide meaningful interpretations of a recently proposed multivariate mutual information measure that was inspired by the secret key agreement problem.

Research Area(s)

  • data storage, multivariate mutual information, secret key agreement, Successive omniscience

Citation Format(s)

Successive Omniscience. / Chan, Chung; Al-Bashabsheh, Ali; Zhou, Qiaoqiao et al.

In: IEEE Transactions on Information Theory, Vol. 62, No. 6, 06.2016, p. 3270-3289.

Research output: Journal Publications and Reviews (RGC: 21, 22, 62)21_Publication in refereed journalpeer-review