Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Lecture notes in computer science

The Five-Card Trick Can Be Done with Four Cards

Takaaki Mizuki, Michihito Kumamoto, Hideaki Sone

Published Jan 1, 2012• 87 citations
Publisher
DOI
10.1007/978-3-642-34961-4_36

Related papers

More Efficient Match-Making and Satisfiability The Five Card Trick

Bert den Boer

Lecture notes in computer science•Jan 1, 1990•161 citations

Another Use of the Five-Card Trick: Card-Minimal Secure Three-Input Majority Function Evaluation

Kodai Toyoda, Daiki Miyahara, Takaaki Mizuki

Lecture notes in computer science•Jan 1, 2021•22 citations

The Six-Card Trick: Secure Computation of Three-Input Equality

Kazumasa Shinagawa, Takaaki Mizuki

Lecture notes in computer science•Jan 1, 2019•32 citations

Practical Construction for Secure Trick-Taking Games Even with Cards Set Aside

Rohann Bella, Xavier Bultel, Céline Chevalier +2 more

Lecture notes in computer science•Nov 30, 2023•2 citations

Five-Card Secure Computations Using Unequal Division Shuffle

Akihiro Nishimura, Takuya Nishida, Yu‐ichi Hayashi +2 more

Lecture notes in computer science•Jan 1, 2015•22 citations

Impossibility of Four-Card AND Protocols with a Single Closed Shuffle

Shizuru Iino, Shota Ikeda, Kazumasa Shinagawa +3 more

Lecture notes in computer science•Nov 12, 2025•1 citation