10 citations · 18 across the 14 of their papers we have counts for
Showing cs.CRShow all
2 papers · 1 filter
cs.CR2022★ 2 cited
Automorphism Shuffles for Graphs and Hypergraphs and Its Applications
Kazumasa Shinagawa, Kengo Miyamoto
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 distribut…
cs.CR2021
Graph Automorphism Shuffles from Pile-Scramble Shuffles
Kengo Miyamoto, Kazumasa Shinagawa
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 articl…