24 citations · 33 across the 7 of their papers we have counts for
9 papers
Cyclic Equalizability of Words and Its Application to Card-Based Cryptography
Kazumasa Shinagawa, Koji Nuida
Card-based cryptography is a research area to implement cryptographic procedures using a deck of physical cards. In recent years, it has been found to be related to finite group th…
A Note on Single-Cut Full-Open Protocols
Kazumasa Shinagawa, Koji Nuida
Card-based cryptography is a research area that realizes cryptographic protocols such as secure computation by applying shuffles to sequences of cards that encode input values. A s…
Simulating Virtual Players for UNO without Computers
Suthee Ruangwises, Kazumasa Shinagawa
UNO is a popular multiplayer card game. In each turn, a player has to play a card in their hand having the same number or color as the most recently played card. When having few pe…
Uniform Cyclic Group Factorizations of Finite Groups
Kazuki Kanai, Kengo Miyamoto, Koji Nuida +1
In this paper, we introduce a kind of decomposition of a finite group called a uniform group factorization, as a generalization of exact factorizations of a finite group. A group $…
Private Simultaneous Messages Based on Quadratic Residues
Kazumasa Shinagawa, Reo Eriguchi, Shohei Satake +1
Private Simultaneous Messages (PSM) model is a minimal model for secure multiparty computation. Feige, Kilian, and Naor (STOC 1994) and Ishai (Cryptology and Information Security S…
Constant-Round Linear-Broadcast Secure Computation with Penalties
Takeshi Nakai, Kazumasa Shinagawa
It is known that Bitcoin enables achieving fairness in secure computation by imposing monetary penalties on adversarial parties. This functionality is called secure computation wit…
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…
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…
Secure Grouping Protocol Using a Deck of Cards
Yuji Hashimoto, Kazumasa Shinagawa, Koji Nuida +2
We consider a problem, which we call secure grouping, of dividing a number of parties into some subsets (groups) in the following manner: Each party has to know the other members o…