论文标题
物理零知识证明自由流，哈密顿周期和多一对k-dischoint覆盖道路
Physical Zero-knowledge Proofs for Flow Free, Hamiltonian Cycles, and Many-to-many k-disjoint Covering Paths
论文作者
论文摘要
在本文中，我们描述了使用标准牌的协议，为哈密顿周期和无流量拼图提供了完美的零知识证明。后者可以轻松扩展，以提供多到许多K-Dischoint路径覆盖的零知识证明的协议。
In this paper we describe protocols which use a standard deck of cards to provide a perfectly sound zero-knowledge proof for Hamiltonian cycles and Flow Free puzzles. The latter can easily be extended to provide a protocol for a zero-knowledge proof of many-to-many k-disjoint path coverings.
