Card-Based Covert Lottery
Card-Based Covert Lottery
复制标题
卡式隐蔽彩票
DOI：
10.1007/978-3-030-69255-1_17
复制
发表时间：
2021
期刊：
影响因子：
--
通讯作者：
Sone Hideaki
中科院分区：
文献类型：
--
作者：
Shinoda Yuto;Miyahara Daiki;Shinagawa Kazumasa;Mizuki Takaaki;Sone Hideaki
在开始玩双人棋盘游戏，如国际象棋和将棋（即日本象棋）之前，我们必须确定谁先走。棋类和将棋的策略往往取决于他们是否会先走，大多数玩家都有自己的偏好。因此，如果我们在决定谁先走的时候能考虑到他们的个人要求，那就太好了。为此，如果两个玩家简单地告诉对方他们更喜欢的动作，他们会注意到对方的策略。因此，我们希望玩家根据他们的请求确定第一步，同时隐藏有关他们的任何信息。请注意，这个问题不能用国际象棋中的典型方法来解决，即抛硬币。在本文中，我们正式这个问题在密码学的角度来看，并提出了一个安全的协议，解决了这个问题，使用一副物理卡。此外，我们将这个问题扩展到多玩家设置：假设有一个单一的奖在一个彩票抽奖中超过两个玩家，每个人都有一个单独的秘密感觉“是”或“否”，表明他/她是否真的想得到的奖品或不。如果有一个或多个玩家选择了“是”，我们就想在那些选择了“是”的玩家中随机秘密地选出一个赢家。如果所有人都选择“否”，我们希望在所有参与者中随机选择一个赢家。我们解决这个扩展的问题，我们称之为“隐蔽彩票”的问题，提出了一个简单的基于卡的协议。
Before starting to play a two-player board game such as Chess and Shogi (namely, Japanese chess), we have to determine who makes the first move. Players’ strategies of Chess and Shogi often rely on whether they will move first or not, and most players have their own preferences. Therefore, it would be nice if we can take their individual requests into account when determining who goes first. To this end, if the two players simply tell their preferable moves to each other, they will notice the other’s strategy. Thus, we want the players to determine the first move according to their requests while hiding any information about them. Note that this problem cannot be solved by a typical way done in Chess, namely, a coin-flipping. In this paper, we formalize this problem in a cryptographic perspective and propose a secure protocol that solves this problem using a deck of physical cards. Moreover, we extend this problem to the multi-player setting: Assume that there is a single prize in a lottery drawing among more than two players, each of who has an individual secret feeling ‘Yes’ or ‘No’ that indicates whether he/she really wants to get the prize or not. If one or more players have ‘Yes,’ we want to randomly and covertly choose a winner among those having ‘Yes.’ If all of them have ‘No,’ we want to randomly pick a winner among all the players. We solve this extended problem, which we call the “covert lottery” problem, by proposing a simple card-based protocol.