Card-based protocols for securely computing the conjunction of multiple variables
From MaRDI portal
Recommendations
Cites work
- Computations with a deck of cards
- scientific article; zbMATH DE number 1339969 (Why is no real title available?)
- scientific article; zbMATH DE number 1024066 (Why is no real title available?)
- More Efficient Match-Making and Satisfiability The Five Card Trick
- Secure multiparty computations without computers
- Six-Card Secure AND and Four-Card Secure XOR
- The five-card trick can be done with four cards
Cited in
(29)- The minimum number of cards in practical card-based protocols
- Secure grouping protocol using a deck of cards
- The six-card trick: secure computation of three-input equality
- Card-based cryptographic protocols for three-input functions using private operations
- Card-based cryptographic protocols with a standard deck of cards using private operations
- Card-based secure ranking computations
- Secure computation of any Boolean function based on any deck of cards
- Information leakage due to operative errors in card-based protocols
- A card-minimal three-input and protocol using two shuffles
- Card-based cryptographic protocols using a minimal number of cards
- A secure additive protocol for card players
- Card-based protocols using triangle cards
- scientific article; zbMATH DE number 2102670 (Why is no real title available?)
- The five-card trick can be done with four cards
- Cryptography and Coding
- Multi-party computation based on physical coins
- Card-minimal protocols for symmetric Boolean functions of more than seven inputs
- Card-based ZKP protocol for Nurimisaki
- Another use of the five-card trick: card-minimal secure three-input majority function evaluation
- Secure computations through checking suits of playing cards
- Card-Based Secure Sorting Protocol
- Card-based ZKP protocols for Takuzu and Juosan
- Card-based protocol against actively revealing card attack
- The landscape of computing symmetric n-variable functions with 2n cards
- Efficient AND protocols resistant to maliciously revealing a single card
- Card-based protocols with single-card encoding
- Barrington plays cards: the complexity of card-based protocols
- Simulating virtual players for UNO without computers
- How to construct physical zero-knowledge proofs for puzzles with a ``single loop condition
This page was built for publication: Card-based protocols for securely computing the conjunction of multiple variables
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5964073)