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

arXiv:1911.05994 · Theoretical Computer Science

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

Suthee Ruangwises, Toshiya Itoh

Published Jul 16, 2021• 43 citations
arXivHTMLPDF
DOI
10.1016/j.tcs.2021.07.007

Related papers

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

Suthee Ruangwises, Toshiya Itoh

Lecture notes in computer science•Jan 1, 2020•19 citations

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

Suthee Ruangwises

arXiv:2306.13551•Lecture notes in computer science•Jan 1, 2023•7 citations

The Six-Card Trick: Secure Computation of Three-Input Equality

Kazumasa Shinagawa, Takaaki Mizuki

Lecture notes in computer science•Jan 1, 2019•33 citations

Card-based protocols for securely computing the conjunction of multiple variables

Takaaki Mizuki

Theoretical Computer Science•Feb 2, 2016•39 citations

Securely Computing the Three-Input Majority Function with Eight Cards

Takuya Nishida, Takaaki Mizuki, Hideaki Sone

Lecture notes in computer science•Jan 1, 2013•45 citations

Secure Computation of Any Boolean Function Based on Any Deck of Cards

Kazumasa Shinagawa, Takaaki Mizuki

Lecture notes in computer science•Jan 1, 2019•17 citations