arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1506.00290cs.DC
收藏

分布式协议中的压缩通信

Compressing Communication in Distributed Protocols

Yael Tauman Kalai, Ilan Komargodski

摘要:

我们展示了如何压缩选择协议中的通信,其目标是仅使用广播信道就随机位序列达成一致。更具体地说,我们提出了一个通用的方法转换任何选择协议,到另一个选择协议,每个消息是“短”,同时保持相同的轮数,相同的输出分布,和相同的弹性错误。假设协议的输出位于某个大小为$M$的域中,在我们得到的协议中,每个消息仅由$\mathsf{polylog}(M,n,d)$多个位组成,其中$n$是参与方的数量,$d$是轮数。我们的转换工作在静态或自适应拜占庭故障的存在。作为推论,我们得出结论,对于任何$\mathsf{poly}(n)$轮集体抛币协议,领导者选举协议,或一般选择协议,长度为$\mathsf{polylog}(n)$的消息就足够了(在静态或自适应拜占庭故障的存在下)。

英文摘要:

We show how to compress communication in selection protocols, where the goal is to agree on a sequence of random bits using only a broadcast channel. More specifically, we present a generic method for converting any selection protocol, into another selection protocol where each message is ``short'' while preserving the same number of rounds, the same output distribution, and the same resilience to error. Assuming that the output of the protocol lies in some universe of size $M$, in our resulting protocol each message consists of only $\mathsf{polylog}(M,n,d)$ many bits, where $n$ is the number of parties and $d$ is the number of rounds. Our transformation works in the presence of either static or adaptive Byzantine faults. As a corollary, we conclude that for any $\mathsf{poly}(n)$-round collective coin-flipping protocol, leader election protocol, or general selection protocols, messages of length $\mathsf{polylog}(n)$ suffice (in the presence of either static or adaptive Byzantine faults).

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑