两副标准的扑克牌足够做一个ZKP数独游戏
Two Standard Decks of Playing Cards are Sufficient for a ZKP for Sudoku
摘要:
数独是一个著名的逻辑难题,玩家必须在$9 \times 9$网格的每个空单元格中填充1到9之间的数字,使得每个数字在每行、每列和每个$3 \times 3$块中只出现一次。2020年,Sasaki等人为数独开发了一种基于物理卡片的零知识证明(ZKP)协议,该协议使证明者能够说服验证者他/她知道谜题的解决方案,而无需透露它。他们的协议使用90张卡片,但需要一些卡片的9个相同副本,这在一副标准的扑克牌(由52张不同的牌和两张小丑牌组成)中是找不到的。因此,需要九个相同的标准甲板来执行该协议,使得该协议不是非常实用。在本文中,我们提出了一个新的ZKP协议的数独,可以只使用两个标准的扑克牌甲板,无论这两个甲板是相同的或不同的。在一般情况下,我们还开发了第一个ZKP协议的广义$n \times n$数独,可以使用一副所有不同的卡。
英文摘要:
Sudoku is a famous logic puzzle where the player has to fill a number between 1 and 9 into each empty cell of a $9 \times 9$ grid such that every number appears exactly once in each row, each column, and each $3 \times 3$ block. In 2020, Sasaki et al. developed a physical card-based protocol of zero-knowledge proof (ZKP) for Sudoku, which enables a prover to convince a verifier that he/she knows a solution of the puzzle without revealing it. Their protocol uses 90 cards, but requires nine identical copies of some cards, which cannot be found in a standard deck of playing cards (consisting of 52 different cards and two jokers). Hence, nine identical standard decks are required to perform that protocol, making the protocol not very practical. In this paper, we propose a new ZKP protocol for Sudoku that can be performed using only two standard decks of playing cards, regardless of whether the two decks are identical or different. In general, we also develop the first ZKP protocol for a generalized $n \times n$ Sudoku that can be performed using a deck of all different cards.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。