How to construct physical zero-knowledge proofs for puzzles with a ``single loop condition
From MaRDI portal
Publication:820565
DOI10.1016/J.TCS.2021.07.019OpenAlexW3184569853WikidataQ113863188 ScholiaQ113863188MaRDI QIDQ820565FDOQ820565
Pascal Lafourcade, Léo Robert, Tatsuya Sasaki, Hideaki Sone, Daiki Miyahara, Takaaki Mizuki
Publication date: 27 September 2021
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2021.07.019
Recommendations
- A physical ZKP for Slitherlink: how to perform physical topology-preserving computation
- Physical ZKP protocols for Nurimisaki and Kurodoko
- Physical Zero-Knowledge Proof for Suguru Puzzle
- Cryptographic and Physical Zero-Knowledge Proof Systems for Solutions of Sudoku Puzzles
- Cryptographic and physical zero-knowledge proof systems for solutions of Sudoku puzzles
Cites Work
- How to construct constant-round zero-knowledge proof systems for NP
- The knowledge complexity of interactive proof-systems
- Computations with a deck of cards
- Basing cryptographic protocols on tamper-evident seals
- Secure computation without computers
- Secure multiparty computations without computers
- Private computation using a PEZ dispenser.
- The minimum number of cards in practical card-based protocols
- Interactive physical ZKP for connectivity: applications to Nurikabe and Hitori
- A physical ZKP for Slitherlink: how to perform physical topology-preserving computation
- Efficient private PEZ protocols for symmetric functions
- Card-based cryptography meets formal verification
- Efficient card-based zero-knowledge proof for Sudoku
- Card-based protocols for secure ranking computations
- A single shuffle is enough for secure card-based computation of any Boolean circuit
- Cryptographic and physical zero-knowledge proof systems for solutions of Sudoku puzzles
- Practical card-based implementations of Yao's millionaire protocol
- Interactive physical zero-knowledge proof for Norinori
- Card-Based Cryptographic Protocols Using a Minimal Number of Cards
- Efficient Card-Based Protocols for Generating a Hidden Random Permutation Without Fixed Points
- Title not available (Why is that?)
- The Five-Card Trick Can Be Done with Four Cards
- More Efficient Match-Making and Satisfiability The Five Card Trick
- Title not available (Why is that?)
- Six-Card Secure AND and Four-Card Secure XOR
- Physical zero-knowledge proof for ripple effect
- Card-based protocols for securely computing the conjunction of multiple variables
- Physical zero-knowledge proof for Makaro
- Foundations for actively secure card-based cryptography
- Card-based ZKP protocols for Takuzu and Juosan
- Physical Zero-Knowledge Proof for Suguru Puzzle
Cited In (21)
- Cryptographic and Physical Zero-Knowledge Proof Systems for Solutions of Sudoku Puzzles
- Verifying the first nonzero term: physical ZKPs for ABC end view, Goishi Hiroi, and Toichika
- Physical zero-knowledge proofs for Five Cells
- Physical zero-knowledge proof for ball sort puzzle
- Physical ZKP protocols for Nurimisaki and Kurodoko
- An improved physical ZKP for nonogram and nonogram color
- A physical zero-knowledge proof for Sumplete, a puzzle generated by ChatGPT
- Cryptographic and physical zero-knowledge proof systems for solutions of Sudoku puzzles
- An improved physical ZKP for Nonogram
- Secure computations through checking suits of playing cards
- Physical zero-knowledge proof protocol for Topswops
- Zero-knowledge proof protocol for cryptarithmetic using dihedral cards
- Physical zero-knowledge proof and NP-completeness proof of Suguru puzzle
- Hide a liar: card-based ZKP protocol for Usowan
- Card-based ZKP protocol for Nurimisaki
- Card-minimal protocols for three-input functions with standard playing cards
- Physical ZKP for Makaro using a standard deck of cards
- Card-based zero-knowledge proof for the nearest neighbor property: zero-knowledge proof of ABC end view
- Physically verifying the first nonzero term in a sequence: physical ZKPs for ABC End View and Goishi Hiroi
- Card-based zero-knowledge proof protocols for graph problems and their computational model
- Two UNO decks efficiently perform zero-knowledge proof for Sudoku
This page was built for publication: How to construct physical zero-knowledge proofs for puzzles with a ``single loop condition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q820565)
