arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2109.00397cs.CRmath.CO
收藏

图的自同构洗牌与堆置乱洗牌

Graph Automorphism Shuffles from Pile-Scramble Shuffles

Kengo Miyamoto, Kazumasa Shinagawa

摘要:

堆置乱是卡片密码学中最有效的置乱之一。事实上,许多基于卡片的协议都是从堆乱打乱中构建的。这篇文章的目的是研究争先赛洗牌的力量。特别是,对于任何有向图$G$,我们介绍了一个新的协议,称为“一个图洗牌协议$G$“,并表明,它可以实现通过使用堆扰洗牌。我们提出的协议需要$2(n+m)$卡,其中$n$和$m$分别是$G$的顶点数和边数。堆乱序混洗的数目是$k+1$,其中$1 \leq k \leq n$是$G$的不同顶点度数的数目。作为一个应用,$n$卡的随机切割,这也是一个重要的洗牌,可以通过$3n$卡和两个堆乱洗牌来实现。

英文摘要:

A pile-scramble shuffle is one of the most effective shuffles in card-based cryptography. Indeed, many card-based protocols are constructed from pile-scramble shuffles. This article aims to study the power of pile-scramble shuffles. In particular, for any directed graph $G$, we introduce a new protocol called "a graph shuffle protocol for $G$", and show that it can be implemented by using pile-scramble shuffles only. Our proposed protocol requires $2(n+m)$ cards, where $n$ and $m$ are the numbers of vertices and edges of $G$, respectively. The number of pile-scramble shuffles is $k+1$, where $1 \leq k \leq n$ is the number of distinct degrees of vertices of $G$. As an application, a random cut for $n$ cards, which is also an important shuffle, can be realized by $3n$ cards and two pile-scramble shuffles.

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

↑