Card-based zero-knowledge proof for Sudoku

Tatsuya Sasaki, Takaaki Mizuki, Hideaki Sone

研究成果: Conference contribution

8 被引用数 (Scopus)

抄録

In 2009, Gradwohl, Naor, Pinkas, and Rothblum proposed physical zero-knowledge proof protocols for Sudoku. That is, for a puzzle instance of Sudoku, their excellent protocols allow a prover to convince a verifier that there is a solution to the Sudoku puzzle and that he/she knows it, without revealing any information about the solution. The possible drawback is that the existing protocols have a soundness error with a non-zero probability or need special cards (such as scratch-off cards). Thus, in this study, we propose new protocols to perform zero-knowledge proof for Sudoku that use a normal deck of playing cards and have no soundness error. Our protocols can be easily implemented by humans with a reasonable number of playing cards.

本文言語English
ホスト出版物のタイトル9th International Conference on Fun with Algorithms, FUN 2018
編集者Giuseppe Prencipe, Hiro Ito, Stefano Leonardi, Linda Pagli
出版社Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
ページ291-2910
ページ数2620
ISBN(電子版)9783959770675
DOI
出版ステータスPublished - 2018 6 1
イベント9th International Conference on Fun with Algorithms, FUN 2018 - La Maddalena Island, Italy
継続期間: 2018 6 132018 6 15

出版物シリーズ

名前Leibniz International Proceedings in Informatics, LIPIcs
100
ISSN(印刷版)1868-8969

Other

Other9th International Conference on Fun with Algorithms, FUN 2018
CountryItaly
CityLa Maddalena Island
Period18/6/1318/6/15

ASJC Scopus subject areas

  • Software

引用スタイル