Computations with a deck of cards

DOI10.1016/S0304-3975(00)00409-6MaRDI QIDQ5941300zbMATH OpenWikidataFDO

Authors A. Stiglic

Publication date 20 August 2001

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0304-3975(00)00409-6

zbMATH Keywords

bit commitmentcardscryptographymultiparty-computationzero-knowledge proofs

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25)

Recommendations

• The Mathematics of Shuffling Cards
• Cards, permutations, and sums
• Secure computations through checking suits of playing cards

Cites work

• scientific article; zbMATH DE number 4101088 (Why is no real title available?)
• scientific article; zbMATH DE number 1304080 (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

Cited in

(36)

• Secure multiparty computations without computers
• The minimum number of cards in practical card-based protocols
• Card-based protocols using unequal division shuffles
• Secure multi-party computation using polarizing cards
• Efficient and secure multiparty computations using a standard deck of playing 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
• Card-based cryptography meets formal verification
• Card-based cryptography with invisible ink
• AND protocols using only uniform shuffles
• 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
• Three steps
• Securely computing XOR with 10 cards
• A colouring protocol for the generalized Russian cards problem
• scientific article; zbMATH DE number 1339969 (Why is no real title available?)
• scientific article; zbMATH DE number 1024066 (Why is no real title available?)
• A geometric protocol for cryptography with cards
• Who holds the best card? Secure communication of optimal secret bits
• Six-Card Secure AND and Four-Card Secure XOR
• The Proportion of Comets in the Card Game SET
• Securely computing the \(n\)-variable equality function with \(2n\) cards
• Card-based protocols for securely computing the conjunction of multiple variables
• Committed-format AND protocol using only random cuts
• Card-minimal protocols for three-input functions with standard playing cards
• Physical ZKP for Makaro using a standard deck of cards
• Actively revealing card attack on card-based protocols
• Single-shuffle card-based protocols with six cards per gate
• Efficient AND protocols resistant to maliciously revealing a single card
• Card-based overwriting protocol for equality function and applications
• Barrington plays cards: the complexity of card-based protocols
• How to construct physical zero-knowledge proofs for puzzles with a ``single loop condition
• Secure aggregation of distributed information: how a team of agents can safely share secrets in front of a spy
• Unconditional secure communication: a Russian cards protocol

This page was built for publication: Computations with a deck of cards

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5941300)