Zero-Knowledge Proof Protocol for?Cryptarithmetic Using Dihedral Cards
Zero-Knowledge Proof Protocol for?Cryptarithmetic Using Dihedral Cards
复制标题
使用二面体卡进行密码算法的零知识证明协议
DOI：
10.1007/978-3-030-87993-8_4
复制
发表时间：
2021
期刊：
影响因子：
--
通讯作者：
Mizuki Takaaki
中科院分区：
文献类型：
--
作者：
Isuzugawa Raimu;Miyahara Daiki;Mizuki Takaaki
密码算法，也被称为文字算术或单词加法，是一种流行的铅笔游戏，其目的是推导出哪个字母对应于哪个数字，给出一个数学公式，其中每个数字(从0到9)都被唯一的字母替换。这个谜题最著名的例子可能是“发送+更多=钱”，它的解是“9567+1085=10652”，即S=9，E=5，N=6，D=7，M=1，O=0，R=8，Y=2。在本研究中，我们构造了一个密码学谜题的物理零知识证明协议：即，我们的协议使知道谜题解的证明者能够在不透露任何相关信息的情况下使验证者相信他/她知道答案。拟议的协议使用了由品川公司于2019年开发的一套物理“二面体卡片”。
Cryptarithmetic, also known as Verbal Arithmetic or Word Addition, is a popular pencil puzzle in which the aim is to deduce which letter corresponds to which numeral, given a mathematical equation in which each numeral (from 0 to 9) has been replaced with a unique letter. The most famous instance of this puzzle is probably “SEND + MORE = MONEY", whose solution is “9567 + 1085 = 10652", i.e., S = 9, E = 5, N = 6, D = 7, M = 1, O = 0, R = 8, and Y = 2. In this study, we construct a physical zero-knowledge proof protocol for a Cryptarithmetic puzzle: That is, our protocol enables a prover who knows a solution to the puzzle to convince a verifier that he/she knows the solution without revealing any information about it. The proposed protocol uses a physical deck of “dihedral cards,” which were developed by Shinagawa in 2019.