arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2305.01355cs.ITcs.DMmath.IT
收藏

多方密钥协商通信复杂度的谱方法

Spectral approach to the communication complexity of multi-party key agreement

Geoffroy Caillat-Grenier, Andrei Romashchenko

AI总结:

本研究提出一种结合图谱性质与信息论不等式的线性代数方法,证明了三方单轮无条件安全密钥协商的渐近紧通信复杂度下界,验证了全知协议的最优性,并将结果推广至单次场景的Kolmogorov复杂度框架。

摘要:

我们提出了一种基于图谱性质的线性代数方法,可用于证明通信复杂度的下界。我们的证明技术有效地将谱界与信息论不等式相结合。核心洞见在于如下观察:在特定场景下,即便数据集$X$与$Y$紧密相关且具有高互信息,$X$的持有者也无法传输一条足够短的消息,使其与$Y$维持可观的互信息。本质上,从$Y$持有者的角度来看,任何足够简短的消息$m=m(X)$都与随机比特序列几乎无法区分。\n我们将这一论证应用于若干通信复杂度问题。我们的主要结果涉及密码学协议。我们建立了具有无条件(即信息论)安全性的多方秘密密钥协商的通信复杂度下界。具体而言,针对三方参与的单轮秘密密钥协商协议(同时消息模型),我们得到了一个渐近紧的下界。该下界表明了此前已知的全知通信协议(omniscience communication protocol)的最优性(该结果适用于三方非交互式秘密密钥协商,且输入数据集具有任意对称信息分布的场景)。\n我们研究了单次场景下的通信问题,其中各方的输入并非由任何独立同分布(i.i.d.)源生成,且对输入数据没有遍历性假设。在该场景下,我们发现使用Kolmogorov复杂度框架来呈现我们的结果是自然的。

英文摘要:

We propose a linear algebraic method, rooted in the spectral properties of graphs, that can be used to prove lower bounds in communication complexity. Our proof technique effectively marries spectral bounds with information-theoretic inequalities. The key insight is the observation that, in specific settings, even when data sets $X$ and $Y$ are closely correlated and have high mutual information, the owner of $X$ cannot convey a reasonably short message that maintains substantial mutual information with $Y$. In essence, from the perspective of the owner of $Y$, any sufficiently brief message $m=m(X)$ would appear nearly indistinguishable from a random bit sequence. We employ this argument in several problems of communication complexity. Our main result concerns cryptographic protocols. We establish a lower bound for communication complexity of multi-party secret key agreement with unconditional, i.e., information-theoretic security. Specifically, for one-round protocols (simultaneous messages model) of secret key agreement with three participants we obtain an asymptotically tight lower bound. This bound implies optimality of the previously known omniscience communication protocol (this result applies to a non-interactive secret key agreement with three parties and input data sets with an arbitrary symmetric information profile). We consider communication problems in one-shot scenarios when the parties' inputs are not produced by any i.i.d. sources, and there are no ergodicity assumptions on the input data. In this setting, we found it natural to present our results using the framework of Kolmogorov complexity.

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

↑