Secure computations through checking suits of playing cards

Cites Work

Unnamed Item
Unnamed Item
How to construct physical zero-knowledge proofs for puzzles with a ``single loop condition
The minimum number of cards in practical card-based protocols
Efficient and secure multiparty computations using a standard deck of playing cards
A secure three-input and protocol with a standard deck of minimal cards
Card-based cryptographic protocols with a standard deck of cards using private operations
Card-based cryptography meets formal verification
Efficient card-based zero-knowledge proof for Sudoku
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
Physical zero-knowledge proof and NP-completeness proof of Suguru puzzle
Information leakage due to operative errors in card-based protocols
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
The Five-Card Trick Can Be Done with Four Cards
More Efficient Match-Making and Satisfiability The Five Card Trick
Six-Card Secure AND and Four-Card Secure XOR
Physical zero-knowledge proof for ripple effect
Card-minimal protocols for three-input functions with standard playing cards
Public-PEZ Cryptography

This page was built for publication: Secure computations through checking suits of playing cards