2022/02/08 by Eammon Hart, Hart, Eammon, Joshua A. McGinnis +1
Computer Science · #Algorithms and Data Compression #Complexity and Algorithms in Graphs #Computability, Logic, AI Algorithms #Cryptography and Security (cs.CR) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #cs.CR #cs.DM
paper · pdf · doi:10.48550/arxiv.2202.04113
Submitted for review
arxiv created 2022/02/08 · openalex publication_date 2022/02/08 · arxiv updated 2022/02/10 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.