Secure Grouping Protocol Using a Deck of Cards
Secure Grouping Protocol Using a Deck of Cards
复制标题
使用一副卡片的安全分组协议
DOI：
10.1587/transfun.e101.a.1512
复制
发表时间：
2017
期刊：
影响因子：
--
通讯作者：
Goichiro Hanaoka
中科院分区：
文献类型：
--
作者：
Yuji Hashimoto;Kazumasa Shinagawa;K. Nuida;Masaki Inamura;Goichiro Hanaoka
我们考虑一个问题，我们称之为安全分组，划分成一些子集（组），以下列方式：每一方必须知道他/她的组的其他成员，而他/她可能不知道任何关于如何其余的政党被划分（除了某些公共预定的约束，如在每个组中的政党的数量）。在本文中，我们构建了一个信息理论上的安全协议，使用一副物理卡来解决这个问题，这是共同执行的各方自己没有可信的第三方。尽管不平凡和潜在的有用性的安全分组，我们提出的协议是相当简单的描述和执行。我们的协议是基于共轭置换的代数性质。我们协议的一个关键成分是我们将乘法和逆运算应用于隐藏排列的新技术（即，那些通过使用面朝下的卡片编码的），这将是独立的兴趣并且将具有各种潜在的应用。
We consider a problem, which we call secure grouping, of dividing a number of parties into some subsets (groups) in the following manner: Each party has to know the other members of his/her group, while he/she may not know anything about how the remaining parties are divided (except for certain public predetermined constraints, such as the number of parties in each group). In this paper, we construct an information-theoretically secure protocol using a deck of physical cards to solve the problem, which is jointly executable by the parties themselves without a trusted third party. Despite the non-triviality and the potential usefulness of the secure grouping, our proposed protocol is fairly simple to describe and execute. Our protocol is based on algebraic properties of conjugate permutations. A key ingredient of our protocol is our new techniques to apply multiplication and inverse operations to hidden permutations (i.e., those encoded by using face-down cards), which would be of independent interest and would have various potential applications.