Card-based ZKP protocol for Nurimisaki

DOI10.1007/978-3-031-21017-4_19MaRDI QIDQ6155254zbMATH OpenFDO

Authors Léo Robert, Daiki Miyahara, Pascal Lafourcade, Takaaki Mizuki

Publication date 12 June 2023

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-031-21017-4_19

zbMATH Keywords

card-based cryptographyNurimisakipencil puzzlezero-knowledge proof

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Card-based ZKP protocols for Takuzu and Juosan
• Hide a liar: card-based ZKP protocol for Usowan
• Physical ZKP protocols for Nurimisaki and Kurodoko
• Card-based cryptographic protocols using a minimal number of cards
• Zero-knowledge proof protocol for cryptarithmetic using dihedral cards
• Card-based cryptographic protocols with a standard deck of cards using private operations
• Card-based zero-knowledge proof protocols for graph problems and their computational model
• An efficient statistical zero-knowledge authentication protocol for smart cards
• Card-based protocols for securely computing the conjunction of multiple variables

Cites work

• An improved physical ZKP for Nonogram
• Card-based ZKP protocols for Takuzu and Juosan
• Cryptographic and physical zero-knowledge proof systems for solutions of Sudoku puzzles
• Efficient card-based zero-knowledge proof for Sudoku
• Foundations for actively secure card-based cryptography
• How to construct physical zero-knowledge proofs for puzzles with a ``single loop condition
• Interactive physical zero-knowledge proof for Norinori
• Interactive physical ZKP for connectivity: applications to Nurikabe and Hitori
• More Efficient Match-Making and Satisfiability The Five Card Trick
• Physical zero-knowledge proof and NP-completeness proof of Suguru puzzle
• Physical zero-knowledge proof for Makaro
• Physical zero-knowledge proofs for Akari, Takuzu, Kakuro and KenKen
• Physical ZKP for connected spanning subgraph: applications to bridges puzzle and other problems
• Securely computing the \(n\)-variable equality function with \(2n\) cards
• Six-Card Secure AND and Four-Card Secure XOR
• The knowledge complexity of interactive proof-systems
• Zero-knowledge proof protocol for cryptarithmetic using dihedral cards

Cited in

(10)

• Interactive physical ZKP for connectivity: applications to Nurikabe and Hitori
• Physical zero-knowledge proof and NP-completeness proof of Suguru puzzle
• Card-based zero-knowledge proof protocols for graph problems and their computational model
• Physical ZKP protocols for Nurimisaki and Kurodoko
• Physical ZKP for Makaro using a standard deck of cards
• Physical zero-knowledge proof for ball sort puzzle
• An improved physical ZKP for nonogram and nonogram color
• Card-based ZKP protocols for Takuzu and Juosan
• Physically verifying the first nonzero term in a sequence: physical ZKPs for ABC End View and Goishi Hiroi
• Physical zero-knowledge proofs for Five Cells

This page was built for publication: Card-based ZKP protocol for Nurimisaki

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6155254)