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

TL;DR

This paper introduces two new card-based cryptographic protocols for securely computing the n-variable equality function using only 2n cards, with generalizations to other symmetric functions and multi-candidate equality functions.

Contribution

The paper presents novel protocols for equality functions in card-based cryptography, optimizing card usage and extending to broader classes of functions.

Findings

Protocols use 2n cards for n-variable equality

Generalizations to doubly symmetric and symmetric functions

Extension to multi-candidate equality functions

Abstract

Research in the area of secure multi-party computation using a deck of playing cards, often called card-based cryptography, started from the introduction of the five-card trick protocol to compute the logical AND function by den Boer in 1989. Since then, many card-based protocols to compute various functions have been developed. In this paper, we propose two new protocols that securely compute the $n$-variable equality function (determining whether all inputs are equal) $E: \{0,1\}^n \rightarrow \{0,1\}$ using $2n$ cards. The first protocol can be generalized to compute any doubly symmetric function $f: \{0,1\}^n \rightarrow \mathbb{Z}$ using $2n$ cards, and any symmetric function $f: \{0,1\}^n \rightarrow \mathbb{Z}$ using $2n+2$ cards. The second protocol can be generalized to compute the $k$-candidate $n$-variable equality function $E: (\mathbb{Z}/k\mathbb{Z})^n \rightarrow \{0,1\}$ using $2 \lceil \lg k \rceil n$ cards.