分布式计算视角下的无条件安全信息传输问题
A Distributed Computing Perspective of Unconditionally Secure Information Transmission in Russian Cards Problems
摘要：
考虑了$A$通过被窃听者$C$偷听到的公共通告向$B$秘密发送信息的问题。为了通过确定性协议来实现这一点，它们的输入必须是相关的。相关输入使用一副牌来表示。存在公知的签名$(a,b,c)$，其中$n = a + b + c + r$和$A$得到一副$n$卡中的$a$卡，$B$得到$b$卡，而$C$得到$c$卡。使用确定性协议，$A$根据她的手来决定其通告。利用编码理论、Johnson图和加法数论中的技术，从分布式计算理论出发，分析了$A$需要发送的信息量，同时防止$C$学习到一手牌.在一个极端，即广义的俄罗斯牌问题中，$B$希望学习$A$的所有牌，而在另一个极端，$B$希望学习$A$的牌。
英文摘要：
The problem of $A$ privately transmitting information to $B$ by a public announcement overheard by an eavesdropper $C$ is considered. To do so by a deterministic protocol, their inputs must be correlated. Dependent inputs are represented using a deck of cards. There is a publicly known signature $(a,b,c)$, where $n = a + b + c + r$, and $A$ gets $a$ cards, $B$ gets $b$ cards, and $C$ gets $c$ cards, out of the deck of $n$ cards. Using a deterministic protocol, $A$ decides its announcement based on her hand. Using techniques from coding theory, Johnson graphs, and additive number theory, a novel perspective inspired by distributed computing theory is provided, to analyze the amount of information that $A$ needs to send, while preventing $C$ from learning a single card of her hand. In one extreme, the generalized Russian cards problem, $B$ wants to learn all of $A$'s cards, and in the other, $B$ wishes to learn something about $A$'s hand.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
