Zeiger的NP完全性与物理零知识证明
NP-Completeness and Physical Zero-Knowledge Proofs for Zeiger
AI总结:
本文通过从NAE3SAT+问题归约证明了Zeiger谜题的可解性判定是NP完全的,并为其构建了基于卡片的物理零知识证明协议以在不泄露解的情况下证明解的存在性。
摘要:
Zeiger是一种铅笔谜题,由一个矩形网格组成,每个单元格中有一个指向水平或垂直方向的箭头。部分单元格还包含一个正整数。该谜题的目标是在每个未编号单元格中填入一个正整数,使得每个单元格中的整数等于该单元格箭头所指方向上所有单元格中不同整数的数量。本文通过从非全等正3SAT(NAE3SAT+)问题进行归约,证明了判定给定Zeiger谜题可解性是NP完全的。我们还为Zeiger构建了一个基于卡片的物理零知识证明协议,使证明者能够在不泄露谜题解的情况下,向验证者物理展示该谜题解的存在性。
英文摘要:
Zeiger is a pencil puzzle consisting of a rectangular grid, with each cell having an arrow pointing in horizontal or vertical direction. Some cells also contain a positive integer. The objective of this puzzle is to fill a positive integer into every unnumbered cell such that the integer in each cell is equal to the number of different integers in all cells along the direction an arrow in that cell points to. In this paper, we prove that deciding solvability of a given Zeiger puzzle is NP-complete via a reduction from the not-all-equal positive 3SAT (NAE3SAT+) problem. We also construct a card-based physical zero-knowledge proof protocol for Zeiger, which enables a prover to physically show a verifier the existence of the puzzle's solution without revealing it.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。