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

公共随机数生成的轮复杂度:摊销设置

Round Complexity of Common Randomness Generation: The Amortized Setting

Noah Golowich, Madhu Sudan

摘要:

我们研究了交互轮数对共同随机数生成(CRG)问题的影响。在CRG问题中,两方Alice和Bob分别接收从源分布$μ$联合提取的样本$X_i$和$Y_i$。双方希望通过交换依赖于每一方的输入和先前消息的消息,就由许多随机比特组成的公共随机密钥达成一致。在这项工作中,我们研究的摊销版本的问题,即,Alice和Bob输出的每个随机比特所需的通信比特数,在所生成的比特数趋于无穷大的极限中。CRG问题的摊销版本已被广泛研究,但很少有人知道这个问题上的相互作用的影响。最近Bafna等人(SODA 2019)考虑了该问题的非摊销版本:他们给出了一个由$r,n\in\mathbb{N}$参数化的源$μ_{r,n}$族,因此使用$r+2$循环的通信可以生成具有$O(r\log n)$通信的该源的公共随机性的$n$位,而使用大致的$r/2$循环,通信复杂度为$Ω(n/{\rm poly}\log n)$。请注意,它们的源是根据目标位数设计的,因此结果不适用于摊销设置。在这项工作中,我们加强了巴夫纳等人的工作。在两个方面:首先,我们表明,结果扩展到摊销设置。我们还将上界和下界中的轮复杂度之间的差距减小到一个加法常数。具体来说,我们表明,对于每对$r,n \in \mathbb{N}$的(摊销)通信复杂性,以产生共同的随机性从源$μ_{r,n}$使用$r+2$轮的$Ω(n)$位的通信是$O(r\log n)$,而摊销的通信需要产生相同数量的随机性从$r$轮是$Ω(\sqrt n)$。

英文摘要:

We study the effect of rounds of interaction on the common randomness generation (CRG) problem. In the CRG problem, two parties, Alice and Bob, receive samples $X_i$ and $Y_i$, respectively, drawn jointly from a source distribution $μ$. The two parties wish to agree on a common random key consisting of many bits of randomness, by exchanging messages that depend on each party's input and the previous messages. In this work we study the amortized version of the problem, i.e., the number of bits of communication needed per random bit output by Alice and Bob, in the limit as the number of bits generated tends to infinity. The amortized version of the CRG problem has been extensively studied, though very little was known about the effect of interaction on this problem. Recently Bafna et al. (SODA 2019) considered the non-amortized version of the problem: they gave a family of sources $μ_{r,n}$ parameterized by $r,n\in\mathbb{N}$, such that with $r+2$ rounds of communication one can generate $n$ bits of common randomness with this source with $O(r\log n)$ communication, whereas with roughly $r/2$ rounds the communication complexity is $Ω(n/{\rm poly}\log n)$. Note that their source is designed with the target number of bits in mind and hence the result does not apply to the amortized setting. In this work we strengthen the work of Bafna et al. in two ways: First we show that the results extend to the amortized setting. We also reduce the gap between the round complexity in the upper and lower bounds to an additive constant. Specifically we show that for every pair $r,n \in \mathbb{N}$ the (amortized) communication complexity to generate $Ω(n)$ bits of common randomness from the source $μ_{r,n}$ using $r+2$ rounds of communication is $O(r\log n)$ whereas the amortized communication required to generate the same amount of randomness from $r$ rounds is $Ω(\sqrt n)$.

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

↑