arXiv:2306.13551 · Lecture notes in computer science

The Landscape of Computing Symmetric n-Variable Functions with 2n Cards

Suthee Ruangwises

Published Jan 1, 2023• 5 citations

Related papers

Securely Computing the n-Variable Equality Function with 2n Cards

Suthee Ruangwises, Toshiya Itoh

Securely computing the n-variable equality function with 2n cards

Suthee Ruangwises, Toshiya Itoh

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

Shota Ikeda, Yoshihiro Takahashi, Kazumasa Shinagawa +1 more

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

Hayato Shikata, Kodai Toyoda, Daiki Miyahara +1 more

Necessary and Sufficient Numbers of Cards for Securely Computing Two-Bit Output Functions

Danny Francis, Syarifah Ruqayyah Aljunid, Takuya Nishida +3 more

Securely Computing the Three-Input Majority Function with Eight Cards

Nishida Takuya, Takaaki Mizuki, Hideaki Sone