Physical Zero-knowledge Proofs for Flow Free, Hamiltonian Cycles, and Many-to-many k-disjoint Covering Paths
Cryptography and Security
2022-02-10 v1 Discrete Mathematics
Abstract
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.
Keywords
Cite
@article{arxiv.2202.04113,
title = {Physical Zero-knowledge Proofs for Flow Free, Hamiltonian Cycles, and Many-to-many k-disjoint Covering Paths},
author = {Eammon Hart and Joshua A. McGinnis},
journal= {arXiv preprint arXiv:2202.04113},
year = {2022}
}
Comments
Submitted for review