打印协议:用于分解谜题的物理零知识证明
Printing Protocol: Physical ZKPs for Decomposition Puzzles
AI总结:
针对分解谜题的解验证需求,提出通用卡牌式printing protocol打印协议,将其应用于Five Cells和Meadows两类谜题,构建出可物理实现的零知识证明协议,实现不泄露解即可证明知晓解的效果。
摘要:
分解谜题是一类纸笔逻辑谜题,需将矩形网格划分为若干区域以满足特定规则。本文构建了一种名为printing protocol(打印协议)的通用卡牌式协议,可用于物理验证分解谜题的解。我们将该打印协议应用于Five Cells(五格谜题)和Meadows(草地谜题)这两类分解谜题,开发出卡牌式零知识证明协议。这类协议能让证明者在不泄露解的前提下,物理证明自己知晓谜题的解。
英文摘要:
Decomposition puzzles are pencil-and-paper logic puzzles that involve partitioning a rectangular grid into several regions to satisfy certain rules. In this paper, we construct a generic card-based protocol called printing protocol, which can be used to physically verify solutions of decompositon puzzles. We apply the printing protocol to develop card-based zero-knowledge proof protocols for two such puzzles: Five Cells and Meadows. These protocols allow a prover to physically show that he/she knows solutions of the puzzles without revealing them.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。