Universal Multiparty Data Exchange and Secret Key Agreement

DOI10.1109/TIT.2017.2694850MaRDI QIDQ5358553zbMATH OpenOpenAlexFDO

Publication date 21 September 2017

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1605.01033

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Abstract: Multiple parties observing correlated data seek to recover each other's data and attain omniscience. To that end, they communicate interactively over a noiseless broadcast channel - each bit transmitted over this channel is received by all the parties. We give a universal interactive communication protocol, termed the recursive data exchange protocol (RDE), which attains omniscience for any sequence of data observed by the parties and provide an individual sequence guarantee of performance. As a by-product, for observations of length

n

, we show the universal rate optimality of RDE up to an

m a t h c a l O l e f t (n^{- f r a c 12} s q r t l o g n i g h t)

term in a generative setting where the data sequence is independent and identically distributed (in time). Furthermore, drawing on the duality between omniscience and secret key agreement due to Csiszar and Narayan, we obtain a universal protocol for generating a multiparty secret key of rate at most

m a t h c a l O l e f t (n^{- f r a c 12} s q r t l o g n i g h t)

less than the maximum rate possible. A key feature of RDE is its recursive structure whereby when a subset

A

of parties recover each-other's data, the rates appear as if the parties have been executing the protocol in an alternative model where the parties in

A

are collocated.

Cited in

(2)

This page was built for publication: Universal Multiparty Data Exchange and Secret Key Agreement

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5358553)