Barrington Plays Cards: The Complexity of Card-based Protocols

10/16/2020

∙

by   Pavel Dvořák, et al.

∙

0

∙

share

In this paper we study the computational complexity of functions that have efficient card-based protocols. Card-based protocols were proposed by den Boer [EUROCRYPT '89] as a means for secure two-party computation. Our contribution is two-fold: We classify a large class of protocols with respect to the computational complexity of functions they compute, and we propose other encodings of inputs which require fewer cards than the usual 2-card representation.