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

仅使用均匀混洗的AND协议

AND Protocols Using Only Uniform Shuffles

Suthee Ruangwises, Toshiya Itoh

摘要:

自1989年den Boer提出“五张牌的把戏”以来,使用一副扑克牌的安全多方计算一直是研究的主题。基于卡片的密码学中的主要问题之一是设计提交格式的协议,以通过使用尽可能少的卡片来计算受不同运行时间和洗牌限制的布尔AND运算。在本文中,我们介绍了两个与协议,只使用均匀洗牌。第一个需要四张卡,是一个重启免费拉斯维加斯协议与有限的预期运行时间。第二个需要五张牌,并且总是在有限的时间内结束。

英文摘要:

Secure multi-party computation using a deck of playing cards has been a subject of research since the "five-card trick" introduced by den Boer in 1989. One of the main problems in card-based cryptography is to design committed-format protocols to compute a Boolean AND operation subject to different runtime and shuffle restrictions by using as few cards as possible. In this paper, we introduce two AND protocols that use only uniform shuffles. The first one requires four cards and is a restart-free Las Vegas protocol with finite expected runtime. The second one requires five cards and always terminates in finite time.

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

↑