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

Six Standard Playing Cards Are Sufficient for All Three-Input Boolean Functions

Masanori Kabutomori, Takaaki Mizuki

Published Jul 14, 2026• 0 citations
Publisher
DOI
10.1007/978-981-92-3309-0_29

Related papers

Card-Minimal Protocols for Three-Input Functions with Standard Playing Cards

Rikuo Haga, Yu‐ichi Hayashi, Daiki Miyahara +1 more

Lecture notes in computer science•Jan 1, 2022•17 citations

Card-Minimal Protocols for Symmetric Boolean Functions of More than Seven Inputs

Hayato Shikata, Kodai Toyoda, Daiki Miyahara +1 more

Lecture notes in computer science•Jan 1, 2022•20 citations

Card-Based Cryptographic Protocols for Three-Input Functions with a Standard Deck of Cards Using Private Operations

Naoki Kobayashi, Yoshifumi Manabe

Lecture notes in computer science•Jan 1, 2025•1 citation

Efficient Three-Input and Four-Input AND Protocols Using Playing Cards with Partial-Open Actions

Yoshiaki Honda, Kazumasa Shinagawa

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

Four Cards Are Sufficient for a Card-Based Three-Input Voting Protocol Utilizing Private Permutations

Takeshi Nakai, Satoshi Shirouchi, Mitsugu Iwamoto +1 more

Lecture notes in computer science•Jan 1, 2017•31 citations

Secure Computation of Any Boolean Function Based on Any Deck of Cards

Kazumasa Shinagawa, Takaaki Mizuki

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