arXiv:1810.00769 · Lecture notes in computer science

AND Protocols Using only Uniform Shuffles

Suthee Ruangwises, Toshiya Itoh

Published Jan 1, 2019• 29 citations

Related papers

How to Implement a Non-uniform or Non-closed Shuffle

Takahiro Saito, Daiki Miyahara, Yuta Abe +2 more

Card-based protocols using unequal division shuffles

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

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

Shizuru Iino, Shota Ikeda, Kazumasa Shinagawa +3 more

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

Daiki Miyahara, Yuichi Hayashi, Takaaki Mizuki +1 more

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

Raimu Isuzugawa, Kodai Toyoda, Yu Sasaki +2 more

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

Tomoki Ono, Kazumasa Shinagawa, Takeshi Nakai +2 more