arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2011.02313cs.CR
收藏

连通生成子图的物理ZKP:在桥谜等问题中的应用

Physical ZKP for Connected Spanning Subgraph: Applications to Bridges Puzzle and Other Problems

Suthee Ruangwises, Toshiya Itoh

摘要:

无向图$G$对于证明者$P$和验证者$V$都是已知的,但是只有$P$知道$G$的子图$H$。在不透露任何关于$H$的信息的情况下,$P$想要使$V$相信$H$是$G$的连通生成子图,即$H$是连通的并且包含$G$的所有顶点。在本文中,我们提出了一个非传统的零知识证明协议,使用一个物理卡片组,这使得$P$物理显示,$H$满足条件,而不透露它。我们还展示了该协议的应用程序,以验证三个著名的NP完全问题的解决方案:汉密尔顿循环问题,最大叶生成树问题,和一个流行的逻辑难题称为桥。

英文摘要:

An undirected graph $G$ is known to both the prover $P$ and the verifier $V$, but only $P$ knows a subgraph $H$ of $G$. Without revealing any information about $H$, $P$ wants to convince $V$ that $H$ is a connected spanning subgraph of $G$, i.e. $H$ is connected and contains all vertices of $G$. In this paper, we propose an unconventional zero-knowledge proof protocol using a physical deck of cards, which enables $P$ to physically show that $H$ satisfies the condition without revealing it. We also show applications of this protocol to verify solutions of three well-known NP-complete problems: the Hamiltonian cycle problem, the maximum leaf spanning tree problem, and a popular logic puzzle called Bridges.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑