arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2010.08445cs.CC
收藏

巴林顿玩纸牌:基于纸牌的协议的复杂性

Barrington Plays Cards: The Complexity of Card-based Protocols

Pavel Dvořák, Michal Koucký

摘要:

在本文中,我们研究的计算复杂性的功能,有效率的卡为基础的协议。基于卡片的协议是由den Boer [EUROCITY PT '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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑