Single-Shuffle Card-Based Protocol with Eight Cards per Gate.

Card-based cryptography allows us to securely compute arbitrary functions using a deck of physical cards. Its performance is mainly measured by the number of used cards and shuffles, and there is a line of work that aims to reduce either of them. One of the seminal work is by Shinagawa and Nuida (Discrete Applied Mathematics 2021) that shows any Boolean function can be constructed by shuffling only once based on the garbling scheme. Their construction requires 2 n + 24 g cards for an n -input Boolean function that is represented by g logical gates. In this paper, we reduce the number of cards to 2 n + 8 g for arbitrary functions while keeping it working with only one shuffle.