@inproceedings{oai:ipsj.ixsq.nii.ac.jp:00208602,
 author = {篠田, 悠斗 and 宮原, 大輝 and 品川, 和雅 and 水木, 敬明 and 曽根, 秀昭 and Yuto, Shinoda and Daiki, Miyahara and Kazumasa, Shinagawa and Takaaki, Mizuki and Hideaki, Sone},
 book = {コンピュータセキュリティシンポジウム2020論文集},
 month = {Oct},
 note = {将棋などの2人で行うボードゲームでは，ゲームを始める手番（先手・後手）によって取りやすい戦略が異なり，プレーヤーごとに得意な手番があるため，プレーヤーの希望を踏まえた上で公平に手番を決めるのが良い．しかし，取りたい手番をそのまま相手に伝えてしまうと，自身の戦略が相手に漏れてしまう．したがって，お互いに取りたい手番の情報は秘匿したまま，自分が持ちたい手番はできるだけ取れるように手番を決定できれば嬉しい．この問題は，現在一般に行われている振り駒やじゃんけんなどでは解決できない．本稿では，この問題の定式化を行い，この問題を解決する「希望に基づく秘匿先手決定プロトコル」を物理的なカード組を用いて構成する．これに加えて，問題を多人数に拡張し，希望者のみから公平かつ秘密に抽選する「隠密抽選プロトコル」も提案する．, We have to decide Sente/Gote (who will be the first player) when we play shogi. It should be decided based on players' requests because strategies of shogi rely on the first move or not and most of players have their preference in regard to Sente/Gote. However, if they simply tell their requests to each other, they will notice the other's strategy. Therefore, it is preferable that they can decide the first turn according to their requests while hiding any information about them. Note that this problem cannot be solved by Furigoma and rock paper scissors. In this paper, we formalize this problem and propose a ``secure protocol for deciding the first turn'' that solves this problem using a deck of physical cards. Moreover, we extend this problem to the multi-player setting and propose a ``covert lottery protocol'' that securely chooses a single player according to their requests.},
 pages = {1260--1266},
 publisher = {情報処理学会},
 title = {希望に基づく秘匿先手決定プロトコルとその拡張},
 year = {2020}
}