English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Zendy Plus

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Zendy Tools

Zendy Open

A pile-scramble shuffle is one of the most effective shuffles in card-basedcryptography. Indeed, many card-based protocols are constructed frompile-scramble shuffles. This article aims to study the power of pile-scrambleshuffles. In particular, for any directed graph $G$, we introduce a newprotocol called "a graph shuffle protocol for $G$", and show that it can beimplemented by using pile-scramble shuffles only. Our proposed protocolrequires $2(n+m)$ cards, where $n$ and $m$ are the numbers of vertices andedges 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 importantshuffle, can be realized by $3n$ cards and two pile-scramble shuffles.

Graph Automorphism Shuffles from Pile-Scramble Shuffles