Card-based cryptographic protocols using a minimal number of cards

DOI10.1007/978-3-662-48797-6_32zbMATH Open1353.94081OpenAlexW2293137013MaRDI QIDQ2811157FDOQ2811157

Authors: Alexander K. Koch, Stefan Walzer, Kevin Härtel 

Publication date: 10 June 2016

Published in: Advances in Cryptology -- ASIACRYPT 2015 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-48797-6_32

Recommendations

• The minimum number of cards in practical card-based protocols
• Computations with a deck of cards
• Six-Card Secure AND and Four-Card Secure XOR
• Card-based protocols for securely computing the conjunction of multiple variables
• Card-based protocols for any Boolean function

zbMATH Keywords

secure computationBoolean ANDcard-based protocolscommitted formatcryptography without computers

Mathematics Subject Classification ID

Authentication, digital signatures and secret sharing (94A62)

Cited In (49)

• Card-based protocols for securely computing the conjunction of multiple variables
• How to construct physical zero-knowledge proofs for puzzles with a ``single loop condition
• Efficient card-based cryptographic protocols for millionaires' problem utilizing private permutations
• Card-based ZKP protocols for Takuzu and Juosan
• Foundations for actively secure card-based cryptography
• Title not available (Why is that?)
• Practical construction for secure trick-taking games even with cards set aside
• The six-card trick: secure computation of three-input equality
• Single-shuffle card-based protocol with eight cards per gate
• Card-based cryptographic protocols for three-input functions using private operations
• A secure three-input and protocol with a standard deck of minimal cards
• The minimum number of cards in practical card-based protocols
• The five-card trick can be done with four cards
• Efficient card-based protocols for generating a hidden random permutation without fixed points
• Actively revealing card attack on card-based protocols
• Card-based cryptography meets formal verification
• A single shuffle is enough for secure card-based computation of any Boolean circuit
• Practical card-based implementations of Yao's millionaire protocol
• The landscape of computing symmetric \(n\)-variable functions with \(2n\) cards
• Securely computing the \(n\)-variable equality function with \(2n\) cards
• Secure computations through checking suits of playing cards
• How to implement a non-uniform or non-closed shuffle
• 21 -- bringing down the complexity: fast composable protocols for card games without secret state
• A secure additive protocol for card players
• Analysis of information leakage due to operative errors in card-based protocols
• Card-based protocols using unequal division shuffles
• Analyzing execution time of card-based protocols
• Information leakage due to operative errors in card-based protocols
• Secure multi-party computation using polarizing cards
• Committed-format AND protocol using only random cuts
• Practical and easy-to-understand card-based implementation of Yao's millionaire protocol
• Card-based ZKP protocol for Nurimisaki
• Card-Based Secure Sorting Protocol
• Card-minimal protocols for three-input functions with standard playing cards
• 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
• Card-minimal protocols for symmetric Boolean functions of more than seven inputs
• A card-minimal three-input and protocol using two shuffles
• Four cards are sufficient for a card-based three-input voting protocol utilizing private permutations
• Secure grouping protocol using a deck of cards
• Card-based protocol against actively revealing card attack
• Multi-party computation based on physical coins
• Efficient and secure multiparty computations using a standard deck of playing cards
• 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
• Title not available (Why is that?)
• Multi-party computation with small shuffle complexity using regular polygon cards
• Card-based cryptographic protocols with a standard deck of cards using private operations

This page was built for publication: Card-based cryptographic protocols using a minimal number of cards

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