Two UNO decks efficiently perform zero-knowledge proof for Sudoku

DOI10.1007/978-3-031-43587-4_29MaRDI QIDQ6546608

Takaaki Mizuki, Kodai Tanaka

Publication date: 29 May 2024

zbMATH Keywords

Sudokuzero-knowledge proofcard-based cryptography

Mathematics Subject Classification ID

Could not fetch data.

Cites Work

• Title not available (Why is that?)
• How to construct physical zero-knowledge proofs for puzzles with a ``single loop condition
• The minimum number of cards in practical card-based protocols
• Interactive physical ZKP for connectivity: applications to Nurikabe and Hitori
• Physical ZKP for connected spanning subgraph: applications to bridges puzzle and other problems
• A physical ZKP for Slitherlink: how to perform physical topology-preserving computation
• Efficient card-based zero-knowledge proof for Sudoku
• Cryptographic and physical zero-knowledge proof systems for solutions of Sudoku puzzles
• Towards user-friendly cryptography
• Physical zero-knowledge proof and NP-completeness proof of Suguru puzzle
• Two standard decks of playing cards are sufficient for a ZKP for Sudoku
• Card-based zero-knowledge proof protocols for graph problems and their computational model
• Card-Based Cryptographic Protocols Using a Minimal Number of Cards
• Efficient Card-Based Protocols for Generating a Hidden Random Permutation Without Fixed Points
• Card-Based Zero-Knowledge Proof for Sudoku
• The knowledge complexity of interactive proof-systems
• Cryptographic and Physical Zero-Knowledge Proof Systems for Solutions of Sudoku Puzzles
• Physical ZKP for Makaro using a standard deck of cards
• Physical zero-knowledge proof for Makaro
• Card-based ZKP protocols for Takuzu and Juosan
• Physical zero-knowledge proof for Numberlink
• Physical Zero-Knowledge Proof for Suguru Puzzle

This page was built for publication: Two UNO decks efficiently perform zero-knowledge proof for Sudoku

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