Card-based protocols using unequal division shuffles

DOI10.1007/S00500-017-2858-2zbMath1398.94147OpenAlexW2763617171MaRDI QIDQ1797742

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

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

cryptographycard gamescard-based protocolscryptography without computersreal-life hands-on cryptographysecure multi-party computations

Mathematics Subject Classification ID

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

Related Items (4)

Card-based cryptographic protocols with a standard deck of cards using private operations ⋮ Committed-format AND protocol using only random cuts ⋮ A card-minimal three-input and protocol using two shuffles ⋮ Card-based cryptographic protocols for three-input functions using private operations

Cites Work

• Unnamed Item
• Theory and practice of natural computing. Second international conference, TPNC 2013, Cáceres, Spain, December 3--5, 2013. Proceedings
• Secure multiparty computations without computers
• Necessary and sufficient numbers of cards for securely computing two-bit output functions
• Card-Based Cryptographic Protocols Using a Minimal Number of Cards
• The Five-Card Trick Can Be Done with Four Cards
• More Efficient Match-Making and Satisfiability The Five Card Trick
• Voting with a Logarithmic Number of Cards
• Six-Card Secure AND and Four-Card Secure XOR
• Computations with a deck of cards

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