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.

中文翻译：

---

巴林顿打牌：基于卡片的协议的复杂性

在本文中，我们研究了具有高效基于卡的协议的函数的计算复杂性。den Boer [EUROCRYPT '89] 提出了基于卡的协议，作为安全两方计算的一种手段。我们的贡献有两个方面：我们根据它们计算的函数的计算复杂性对一大类协议进行分类，并且我们提出了其他输入编码，这些编码需要比通常的 2 卡表示更少的卡。