CS 758 Project: Secure Computation with Playing Cards
CS 758 Project: Secure Computation with Playing Cards
复制标题
CS 758 项目：使用扑克牌进行安全计算
DOI：
10.1103/physrevd.97.103526
复制
发表时间：
2017
影响因子：
5
通讯作者：
Patrick Lee
中科院分区：
文献类型：
--
作者：
Eddie Cheung;Christa Hawthorne;Patrick Lee
有几个基于卡片的协议用于布尔AND的安全计算;目前最知名的提交协议使用6张卡片。我们提出了一个新的拉斯维加斯承诺的协议，使用5张卡，减少了所需的卡的数量。Mizuki等人提出了几种基于卡片的协议，可以表示为xgx-1形式的置换。我们证明了任何期望的置换h与g具有相同的循环结构，可以使用xgx − 1形式的置换得到，我们给出了一种计算这样的置换的技术。
There exist several card-based protocols for the secure computation of a boolean AND; currently the best known committed protocols use 6 cards. We present a new Las Vegas committed protocol that uses 5 cards, reducing the number of cards needed. Mizuki et al. have presented several card-based protocols that can be expressed as a permutation of the form xgx − 1 . We show that any desired permutation h with the same cycle structure as g can be obtained using a permutation of the form xgx − 1 and we give a technique to compute such a permutation.