Lecture notes in computer science

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

Takuto Yoshida, K. Tanaka, Keisuke Nakabayashi, Eikoh Chida, Takaaki Mizuki

Published Jan 1, 2023• 7 citations

Related papers

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

Raimu Isuzugawa, Kodai Toyoda, Yu Sasaki +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

A Lower Bound on the Number of Shuffles for Commited-Format AND Protocols

Daiki Miyahara, Yuichi Hayashi, Takaaki Mizuki +1 more

A-7-2 Card-Based Cryptographic Protocols Using Anomalous Shuffle

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