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

Related papers

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

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

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

Hayato Shikata, Kodai Toyoda, Daiki Miyahara +1 more

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

Naoki Kobayashi, Yoshifumi Manabe

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

Yoshiaki Honda, Kazumasa Shinagawa

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

Takeshi Nakai, Satoshi Shirouchi, Mitsugu Iwamoto +1 more

A Secure Three-Input AND Protocol with a Standard Deck of Minimal Cards

Hiroto Koyama, Daiki Miyahara, Takaaki Mizuki +1 more