Pages that link to "Item:Q2272198"
From MaRDI portal
The following pages link to Cryptographic and physical zero-knowledge proof systems for solutions of Sudoku puzzles (Q2272198):
Displaying 15 items.
- How to construct physical zero-knowledge proofs for puzzles with a ``single loop'' condition (Q820565) (← links)
- Interactive physical ZKP for connectivity: applications to Nurikabe and Hitori (Q2117799) (← links)
- An improved physical ZKP for Nonogram (Q2149876) (← links)
- Zero-knowledge proof protocol for cryptarithmetic using dihedral cards (Q2152086) (← links)
- Physical ZKP for connected spanning subgraph: applications to bridges puzzle and other problems (Q2152094) (← links)
- Efficient card-based zero-knowledge proof for Sudoku (Q2196568) (← links)
- Efficient generation of a card-based uniformly distributed random derangement (Q2232235) (← links)
- Physical zero-knowledge proof and NP-completeness proof of Suguru puzzle (Q2672240) (← links)
- Non-interactive composition of sigma-protocols via Share-then-Hash (Q2691604) (← links)
- Two standard decks of playing cards are sufficient for a ZKP for Sudoku (Q2695333) (← links)
- Card-based zero-knowledge proof protocols for graph problems and their computational model (Q2697917) (← links)
- Card-Based Zero-Knowledge Proof for Sudoku (Q3301020) (← links)
- Physical zero-knowledge proof for ripple effect (Q5925530) (← links)
- Physical ZKP protocols for Nurimisaki and Kurodoko (Q6093570) (← links)
- An improved physical ZKP for nonogram and nonogram color (Q6173939) (← links)
