Automorphism Shuffles for Graphs and Hypergraphs and Its Applications. (arXiv:2205.04774v1 [cs.CR])

In card-based cryptography, a deck of physical cards is used to achieve
secure computation. A shuffle, which randomly permutes a card-sequence along
with some probability distribution, ensures the security of a card-based
protocol. The authors proposed a new class of shuffles called graph shuffles,
which randomly permutes a card-sequence by an automorphism of a directed graph
(New Generation Computing 2022). For a directed graph $G$ with $n$ vertices and
$m$ edges, such a shuffle could be implemented with pile-scramble shuffles …

applications