Lecture notes in computer science

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

Raimu Isuzugawa, Kodai Toyoda, Yu Sasaki, Daiki Miyahara, Takaaki Mizuki

Published Jan 1, 2021• 15 citations

Related papers

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

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

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

Hiroto Koyama, Daiki Miyahara, Takaaki Mizuki +1 more

Upper Bounds on the Number of Shuffles for Two-Helping-Card Multi-Input AND Protocols

Takuto Yoshida, K. Tanaka, Keisuke Nakabayashi +2 more

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

Shizuru Iino, Shota Ikeda, Kazumasa Shinagawa +3 more

Card-based protocols using unequal division shuffles

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

Single-Shuffle Card-Based Protocols with Six Cards per Gate

Tomoki Ono, Kazumasa Shinagawa, Takeshi Nakai +2 more