Six-Card Secure AND and Four-Card Secure XOR
From MaRDI portal
Recommendations
Cites work
- Automata, Languages and Programming
- Bounds on secret key exchange using a random deal of cards
- Characterization of optimal key set protocols
- Computations with a deck of cards
- scientific article; zbMATH DE number 981617 (Why is no real title available?)
- scientific article; zbMATH DE number 1024066 (Why is no real title available?)
- scientific article; zbMATH DE number 1390053 (Why is no real title available?)
- scientific article; zbMATH DE number 2230917 (Why is no real title available?)
- Polling with Physical Envelopes: A Rigorous Analysis of a Human-Centric Protocol
- Private computation using a PEZ dispenser.
- Secure multiparty computations without computers
- Securely computing XOR with 10 cards
Cited in
(53)- The minimum number of cards in practical card-based protocols
- Card-based protocols using unequal division shuffles
- Secure multi-party computation using polarizing cards
- Card-based cryptographic protocols for three-input functions using private operations
- A secure three-input and protocol with a standard deck of minimal cards
- Card-based cryptographic protocols with a standard deck of cards using private operations
- An improved physical ZKP for Nonogram
- Card-based protocols for secure ranking computations
- A single shuffle is enough for secure card-based computation of any Boolean circuit
- Efficient generation of a card-based uniformly distributed random derangement
- Practical card-based implementations of Yao's millionaire protocol
- AND protocols using only uniform shuffles
- Necessary and sufficient numbers of cards for securely computing two-bit output functions
- Information leakage due to operative errors in card-based protocols
- A card-minimal three-input and protocol using two shuffles
- Card-based zero-knowledge proof protocols for graph problems and their computational model
- Card-based cryptographic protocols using a minimal number of cards
- Efficient card-based protocols for generating a hidden random permutation without fixed points
- Card-based protocols for any Boolean function
- Card-based protocols using triangle cards
- Securely computing XOR with 10 cards
- The five-card trick can be done with four cards
- Securely computing the \(n\)-variable equality function with \(2n\) cards
- Card-based protocols for securely computing the conjunction of multiple variables
- Multi-party computation based on physical coins
- Physical ZKP protocols for Nurimisaki and Kurodoko
- Committed-format AND protocol using only random cuts
- Card-minimal protocols for three-input functions with standard playing cards
- Card-minimal protocols for symmetric Boolean functions of more than seven inputs
- Hide a liar: card-based ZKP protocol for Usowan
- Card-based zero-knowledge proof for the nearest neighbor property: zero-knowledge proof of ABC end view
- Actively revealing card attack on card-based protocols
- Single-shuffle card-based protocol with eight cards per gate
- 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
- An improved physical ZKP for nonogram and nonogram color
- Card-Based Secure Sorting Protocol
- Card-based protocol against actively revealing card attack
- Single-shuffle card-based protocols with six cards per gate
- Free-XOR in card-based garbled circuits
- A physical zero-knowledge proof for Sumplete, a puzzle generated by ChatGPT
- The landscape of computing symmetric n-variable functions with 2n cards
- Efficient AND protocols resistant to maliciously revealing a single card
- Visualizing differentially private mechanisms with physical cards
- Card-based protocols with single-card encoding
- How to play Old Maid with virtual players
- How to play Old Maid with virtual players
- Card-based cryptography meets 3D printer
- Card-based overwriting protocol for equality function and applications
- Barrington plays cards: the complexity of card-based protocols
- The landscape of optimal card-based protocols
- How to construct physical zero-knowledge proofs for puzzles with a ``single loop condition
This page was built for publication: Six-Card Secure AND and Four-Card Secure XOR
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5321728)
