Unconditional secure communication: a Russian Cards protocol
Unconditional secure communication: a Russian Cards protocol
复制标题
DOI：
10.1007/s10878-009-9252-7
复制
发表时间：
2010-05
影响因子：
1
通讯作者：
Zhenhua Duan;Chen Yang
中科院分区：
文献类型：
--
作者：
Zhenhua Duan;Chen Yang
本文研究了无条件安全通信中的Russian Cards问题。首先，针对3人7张牌的问题，给出了一个拾取规则和删除规则以及安全通信条件。此外，该问题被推广到tacklenplayers和n（n-1）+1张牌。提出了一种新的构造公告牌的挑选规则，并形式化了一种新的参与者确定对方牌的删除规则。并证明了通信的安全条件。此外，为了说明该方法，一个例子，5个球员和21张牌的详细介绍。
This paper investigates Russian Cards problem for the purpose of unconditional secure communication. First, a picking rule and deleting rule as well as safe communication condition are given to deal with the problem with 3 players and 7 cards. Further, the problem is generalized to tacklenplayers andn(n−1)+1 cards. A new picking rule for constructing the announcement is presented, and a new deleting rule for players to determine each other’s cards is formalized. Moreover, the safe communication condition is proved. In addition, to illustrate the approach, an example for 5 players and 21 cards is presented in detail.