Single-shuffle card-based protocol with eight cards per gate
DOI10.1007/978-3-031-34034-5_12MaRDI QIDQ6149130FDOQ6149130
Kazunari Tozawa, Takaaki Mizuki, Hiraku Morita
Publication date: 12 January 2024
Published in: Unconventional Computation and Natural Computation (Search for Journal in Brave)
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Quantum algorithms and complexity in the theory of computing (68Q12) Other nonclassical models of computation (68Q09) Biologically inspired models of computation (DNA computing, membrane computing, etc.) (68Q07)
Cites Work
- The minimum number of cards in practical card-based protocols
- Card-based cryptography meets formal verification
- A single shuffle is enough for secure card-based computation of any Boolean circuit
- 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
- The six-card trick: secure computation of three-input equality
- Voting with a Logarithmic Number of Cards
- Analyzing execution time of card-based protocols
- A secure three-input and protocol with a standard deck of minimal cards
- Card-Based Protocols for Any Boolean Function
- Physical ZKP for connected spanning subgraph: applications to bridges puzzle and other problems
- Zero-knowledge proof protocol for cryptarithmetic using dihedral cards
- Securely computing the \(n\)-variable equality function with \(2n\) cards
- Card-minimal protocols for three-input functions with standard playing cards
- Another use of the five-card trick: card-minimal secure three-input majority function evaluation
- Card-minimal protocols for symmetric Boolean functions of more than seven inputs
Cited In (1)
This page was built for publication: Single-shuffle card-based protocol with eight cards per gate
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6149130)