arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2603.18608cs.CR
收藏

基于卡片协议的洗牌复杂性层级

A Complexity Hierarchy of Shuffles in Card-Based Protocols

The University of Electro-Communications(电波通信大学);Department of Computer Engineering, Faculty of Engineering, Chulalongkorn University(朱拉隆功大学工程学院计算机工程系)

Tomoki Ono, Suthee Ruangwises

AI总结:

本文从实践和理论角度对卡片协议中的洗牌操作进行复杂性分级,证明不同层级间的分离结果,并提出新的评估指标。

摘要:

基于物理卡片的密码学利用实体扑克牌构建安全多方计算协议。现有卡片协议使用各种类型的洗牌,其中一些易于实现,而另一些则更为复杂。本文根据实现复杂性将洗牌操作分为几个级别。我们从实践和理论角度动机这一层级,并通过证明某些洗牌无法仅使用更低层级的操作来分离几个层级。最后,我们提出了一种基于此层级的新复杂性度量标准,用于评估卡片协议。

英文摘要:

Card-based cryptography uses physical playing cards to construct protocols for secure multi-party computation. Existing card-based protocols employ various types of shuffles, some of which are easy to implement in practice while others are considerably more complex. In this paper, we classify shuffle operations into several levels according to their implementation complexity. We motivate this hierarchy from both practical and theoretical perspectives, and prove separation results between several levels by showing that certain shuffles cannot be realized using only operations from lower levels. Finally, we propose a new complexity measure for evaluating card-based protocols based on this hierarchy.

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

↑