Single-shuffle card-based protocol with eight cards per gate

DOI10.1007/978-3-031-34034-5_12MaRDI QIDQ6149130zbMATH OpenFDO

Authors Kazunari Tozawa, Hiraku Morita, Takaaki Mizuki

Publication date 12 January 2024

Published in Unconventional Computation and Natural Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-031-34034-5_12

zbMATH Keywords

card-based cryptographygarbled circuitXOR shuffle

Mathematics Subject Classification ID

Biologically inspired models of computation (DNA computing, membrane computing, etc.) (68Q07) Other nonclassical models of computation (68Q09) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Quantum algorithms and complexity in the theory of computing (68Q12)

Cites work

• A secure three-input and protocol with a standard deck of minimal cards
• A single shuffle is enough for secure card-based computation of any Boolean circuit
• Analyzing execution time of card-based protocols
• Another use of the five-card trick: card-minimal secure three-input majority function evaluation
• Card-based cryptographic protocols using a minimal number of cards
• Card-based cryptography meets formal verification
• Card-based protocols for any Boolean function
• Card-minimal protocols for symmetric Boolean functions of more than seven inputs
• Card-minimal protocols for three-input functions with standard playing cards
• Efficient card-based protocols for generating a hidden random permutation without fixed points
• More Efficient Match-Making and Satisfiability The Five Card Trick
• 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 five-card trick can be done with four cards
• The minimum number of cards in practical card-based protocols
• The six-card trick: secure computation of three-input equality
• Voting with a Logarithmic Number of Cards
• Zero-knowledge proof protocol for cryptarithmetic using dihedral cards

Cited in

(2)

• Single-shuffle card-based protocols with six cards per gate
• Visualizing differentially private mechanisms with physical cards

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)