The minimum number of cards in practical card-based protocols

DOI10.1007/978-3-319-70700-6_5MaRDI QIDQ1701439zbMATH OpenOpenAlexFDO

Authors Julia Kastner, Stefan Walzer, Daiki Miyahara, Yu-ichi Hayashi, Takaaki Mizuki, Hideaki Sone, Alexander K. Koch

Publication date 23 February 2018

Full work available at URL https://doi.org/10.1007/978-3-319-70700-6_5

zbMATH Keywords

secure computationcopyBoolean ANDcard-based protocolscommitted formatcryptography without computers

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Card-based cryptographic protocols using a minimal number of cards
• Six-Card Secure AND and Four-Card Secure XOR
• Computations with a deck of cards
• Card-based protocols using unequal division shuffles
• Card-based protocols for securely computing the conjunction of multiple variables

Cited in

(24)

• How to construct physical zero-knowledge proofs for puzzles with a ``single loop condition
• Foundations for actively secure card-based cryptography
• Card-based cryptographic protocols for three-input functions using private operations
• A secure three-input and protocol with a standard deck of minimal cards
• Single-shuffle card-based protocol with eight cards per gate
• Efficient card-based protocols for generating a hidden random permutation without fixed points
• Card-based cryptographic protocols using a minimal number of cards
• The five-card trick can be done with four cards
• Card-based cryptography meets formal verification
• A single shuffle is enough for secure card-based computation of any Boolean circuit
• How to implement a non-uniform or non-closed shuffle
• Secure computations through checking suits of playing cards
• Card-based protocols using unequal division shuffles
• Committed-format AND protocol using only random cuts
• Necessary and sufficient numbers of cards for securely computing two-bit output functions
• Another use of the five-card trick: card-minimal secure three-input majority function evaluation
• A card-minimal three-input and protocol using two shuffles
• Card-minimal protocols for symmetric Boolean functions of more than seven inputs
• Card-based zero-knowledge proof for the nearest neighbor property: zero-knowledge proof of ABC end view
• Six-Card Secure AND and Four-Card Secure XOR
• Two UNO decks efficiently perform zero-knowledge proof for Sudoku
• Single-shuffle card-based protocols with six cards per gate
• Upper bounds on the number of shuffles for two-helping-card multi-input AND protocols
• Card-based cryptographic protocols with a standard deck of cards using private operations

This page was built for publication: The minimum number of cards in practical card-based protocols

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