论文标题
巴灵顿播放卡：基于卡的协议的复杂性
Barrington Plays Cards: The Complexity of Card-based Protocols
论文作者
论文摘要
在本文中，我们研究具有有效基于卡的协议的功能的计算复杂性。基于卡的协议是由Den Boer [Eurocrypt '89]提出的，作为安全两方计算的一种手段。我们的贡献是两个方面的：我们就它们计算的函数的计算复杂性进行了大量协议，并且我们提出的其他输入的编码比通常的2卡表示，需要少的卡。
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.
