Efficient Card-Based Majority Voting Protocols
Efficient Card-Based Majority Voting Protocols
复制标题
高效的基于卡的多数投票协议
DOI：
10.1007/s00354-022-00161-7
复制
发表时间：
2022
影响因子：
2.6
通讯作者：
and Ohta Kazuo
中科院分区：
文献类型：
--
作者：
Abe Yoshiki;Nakai Takeshi;Kuroki Yoshihisa;Suzuki Shinnosuke;Koga Yuta;Watanabe Yohei;Iwamoto Mitsugu;and Ohta Kazuo
基于卡的密码学是安全多方计算（MPC）的一种。最近，引入了一种称为私有操作的新技术，因为该协议可以使用比使用称为洗牌的传统技术更少的牌来实现。例如，Nakai等人表明，如果私有操作可用，则可以使用四张卡同时实现两个输入的AND和OR操作的安全计算，并将该协议应用于三输入的四卡多数投票协议。本文表明，仅三张卡就足以构建具有三个输入的多数投票协议。具体来说，我们提出了两种三输入多数投票协议的结构。一个是协议，假设玩家可以宣布他们的输出，另一个是不允许的。与Nakai等人的协议相比，带有公告的协议实现时没有任何额外的私有操作和通信。另一方面，第二个结构需要更多的私人操作和通信，因为它消除了第一个结构对公告的假设。更重要的是，第二种协议的思想可以扩展到无输入多数投票协议的撤销，这是本文的主要成果。
Card-based cryptography is a variety of secure multiparty computation (MPC). Recently, a new technique called private operations was introduced because the protocol can be implemented with fewer cards than that by using the conventional technique called the shuffle. For example, Nakai et al. showed that if the private operations are available, secure computations of AND and OR operations for two inputs can be realized simultaneously by using four cards, and the protocol is applied to a four-card majority voting protocol with three inputs. This paper shows that only three cards are sufficient to construct a majority voting protocol with three inputs. Specifically, we propose two constructions of three-input majority voting protocols. One is a protocol assuming that players can announce their output, and the other is not allowed. Compared to Nakai et al.’s protocol, the protocol with the announcement is realized without any additional private operations and communications. On the other hand, the second construction requires two more private operations and communications because it removes the assumption on the announcement from the first construction. More importantly, the idea of the second protocol can be extended to ann-input majority voting protocol withncards, which is the main result of this paper.