Pages that link to "Item:Q2117799"
From MaRDI portal
The following pages link to Interactive physical ZKP for connectivity: applications to Nurikabe and Hitori (Q2117799):
Displaying 17 items.
- How to construct physical zero-knowledge proofs for puzzles with a ``single loop'' condition (Q820565) (← links)
- Card-based cryptographic protocols for three-input functions using private operations (Q2115886) (← links)
- Card-based cryptographic protocols with a standard deck of cards using private operations (Q2119979) (← 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)
- 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)
- Physical zero-knowledge proof for ripple effect (Q5925530) (← links)
- Physical ZKP protocols for Nurimisaki and Kurodoko (Q6093570) (← links)
- Card-minimal protocols for three-input functions with standard playing cards (Q6103095) (← links)
- Physical ZKP for Makaro using a standard deck of cards (Q6111941) (← links)
- Card-based zero-knowledge proof for the nearest neighbor property: zero-knowledge proof of ABC end view (Q6112013) (← links)
- Card-based ZKP protocol for Nurimisaki (Q6155254) (← links)
- Card-Based Secure Sorting Protocol (Q6487420) (← links)
- Physically verifying the first nonzero term in a sequence: physical ZKPs for ABC End View and Goishi Hiroi (Q6535813) (← links)
- Two UNO decks efficiently perform zero-knowledge proof for Sudoku (Q6546608) (← links)