Computations with a deck of cards

DOI10.1016/S0304-3975(00)00409-6zbMath0974.68054WikidataQ127179064 ScholiaQ127179064MaRDI QIDQ5941300

A. Stiglic

Publication date: 20 August 2001

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

zbMATH Keywords

cryptographybit commitmentcardsmultiparty-computationzero-knowledge proofs

Mathematics Subject Classification ID

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

Related Items (15)

How to construct physical zero-knowledge proofs for puzzles with a ``single loop condition ⋮ Six-Card Secure AND and Four-Card Secure XOR ⋮ Efficient Card-Based Protocols for Generating a Hidden Random Permutation Without Fixed Points ⋮ A colouring protocol for the generalized Russian cards problem ⋮ Committed-format AND protocol using only random cuts ⋮ Secure aggregation of distributed information: how a team of agents can safely share secrets in front of a spy ⋮ Actively revealing card attack on card-based protocols ⋮ Unnamed Item ⋮ A geometric protocol for cryptography with cards ⋮ Securely computing the \(n\)-variable equality function with \(2n\) cards ⋮ Unconditional secure communication: a Russian cards protocol ⋮ Card-based protocols for securely computing the conjunction of multiple variables ⋮ Card-based protocols using unequal division shuffles ⋮ Three Steps ⋮ Card-based cryptographic protocols for three-input functions using private operations

Cites Work

• Secure multiparty computations without computers
• More Efficient Match-Making and Satisfiability The Five Card Trick
• Unnamed Item
• Unnamed Item
• Unnamed Item

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