Another use of the five-card trick: card-minimal secure three-input majority function evaluation
From MaRDI portal
Publication:6157606
DOI10.1007/978-3-030-92518-5_24zbMath1514.94133OpenAlexW4206817521MaRDI QIDQ6157606
Daiki Miyahara, Kodai Toyoda, Takaaki Mizuki
Publication date: 12 May 2023
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-030-92518-5_24
Related Items (3)
Card-minimal protocols for three-input functions with standard playing cards ⋮ Card-minimal protocols for symmetric Boolean functions of more than seven inputs ⋮ Single-shuffle card-based protocol with eight cards per gate
Cites Work
- Private computation using a PEZ dispenser.
- The minimum number of cards in practical card-based protocols
- Four cards are sufficient for a card-based three-input voting protocol utilizing private permutations
- Efficient private PEZ protocols for symmetric functions
- AND protocols using only uniform shuffles
- Card-Based Cryptographic Protocols Using a Minimal Number of Cards
- More Efficient Match-Making and Satisfiability The Five Card Trick
- Six-Card Secure AND and Four-Card Secure XOR
This page was built for publication: Another use of the five-card trick: card-minimal secure three-input majority function evaluation
