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

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

Hayato Shikata, Kodai Toyoda, Daiki Miyahara, Takaaki Mizuki

Published Jan 1, 2022• 19 citations
Publisher
DOI
10.1007/978-3-031-17715-6_25

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-Based Protocols for Any Boolean Function

Takuya Nishida, Yu‐ichi Hayashi, Takaaki Mizuki +1 more

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

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

Masanori Kabutomori, Takaaki Mizuki

Lecture notes in computer science•Jul 14, 2026•0 citations

A Card-Minimal Three-Input AND Protocol Using Two Shuffles

Raimu Isuzugawa, Kodai Toyoda, Yu Sasaki +2 more

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

Efficient Card-Based Protocols for Symmetric and Partially Doubly Symmetric Functions

Shota Ikeda, Yoshihiro Takahashi, Kazumasa Shinagawa +1 more

Lecture notes in computer science•Nov 24, 2025•2 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