Card-based protocols using unequal division shuffles

DOI10.1007/S00500-017-2858-2MaRDI QIDQ1797742zbMATH OpenOpenAlexFDO

Authors Akihiro Nishimura, Takuya Nishida, Yu-ichi Hayashi, Takaaki Mizuki, Hideaki Sone

Publication date 22 October 2018

Published in Soft Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00500-017-2858-2

zbMATH Keywords

cryptographysecure multi-party computationscard gamescard-based protocolscryptography without computersreal-life hands-on cryptography

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• Card-based cryptographic protocols using a minimal number of cards
• The minimum number of cards in practical card-based protocols
• Computations with a deck of cards
• Card-based protocols for any Boolean function
• Securely computing the \(n\)-variable equality function with \(2n\) cards

Cites work

• scientific article; zbMATH DE number 1024066 (Why is no real title available?)
• Card-based cryptographic protocols using a minimal number of cards
• Computations with a deck of cards
• More Efficient Match-Making and Satisfiability The Five Card Trick
• Necessary and sufficient numbers of cards for securely computing two-bit output functions
• Secure multiparty computations without computers
• Six-Card Secure AND and Four-Card Secure XOR
• The five-card trick can be done with four cards
• Theory and practice of natural computing. Second international conference, TPNC 2013, Cáceres, Spain, December 3--5, 2013. Proceedings
• Voting with a Logarithmic Number of Cards

Cited in

(9)

• Foundations for actively secure card-based cryptography
• Card-based cryptographic protocols for three-input functions using private operations
• The minimum number of cards in practical card-based protocols
• How to implement a non-uniform or non-closed shuffle
• Analysis of information leakage due to operative errors in card-based protocols
• Committed-format AND protocol using only random cuts
• A card-minimal three-input and protocol using two shuffles
• Single-shuffle card-based protocols with six cards per gate
• Card-based cryptographic protocols with a standard deck of cards using private operations

This page was built for publication: Card-based protocols using unequal division shuffles

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