Zero-Knowledge Proof of Knowledge for Peg Solitaire - Archive ouverte HAL Access content directly
Conference Papers Year : 2022

Zero-Knowledge Proof of Knowledge for Peg Solitaire

Xavier Bultel


Peg solitaire is a very popular traditional single-player board game, known to be NP-complete. In this paper, we present a zero-knowledge proof of knowledge for solutions of peg solitaire instances. Our proof is straightforward, in the sense that it does not use any reduction to another NP-complete problem, and uses the standard design of sigma protocols. Our construction relies on cryptographic commitments, which can be replaced by envelopes to make the protocol physical. As a side contribution, we introduce the notion of isomorphisms for peg solitaire, which is the key tool of our protocol.
Fichier principal
Vignette du fichier
LIPIcs-FUN-2022-9.pdf (849.77 Ko) Télécharger le fichier
Origin Publisher files allowed on an open archive

Dates and versions

hal-03754563 , version 1 (19-08-2022)



Xavier Bultel. Zero-Knowledge Proof of Knowledge for Peg Solitaire. 11th International Conference on Fun with Algorithms (FUN 2022), May 2022, Favignana, Italy. ⟨10.4230/LIPIcs.FUN.2022.9⟩. ⟨hal-03754563⟩
34 View
84 Download



Gmail Mastodon Facebook X LinkedIn More