Single-shuffle full-open card-based secure computation protocols for any function
From MaRDI portal
Cites work
- A minimal model for secure computation (extended abstract)
- A single shuffle is enough for secure card-based computation of any Boolean circuit
- Another use of the five-card trick: card-minimal secure three-input majority function evaluation
- Card-based protocols for any Boolean function
- Card-based protocols imply PSM protocols
- Card-minimal protocols for symmetric Boolean functions of more than seven inputs
- Cyclic equalizability of words and its application to card-based cryptography
- Discret solitary games
- Efficient card-based protocols for generating a hidden random permutation without fixed points
- More Efficient Match-Making and Satisfiability The Five Card Trick
- Practical card-based implementations of Yao's millionaire protocol
- Securely computing the n-variable equality function with 2n cards
- Single-shuffle card-based protocol with eight cards per gate
- Single-shuffle card-based protocols with six cards per gate
- The complexity of multiparty PSM protocols and related models
- 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
This page was built for publication: Single-shuffle full-open card-based secure computation protocols for any function
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7442680)