Secure Multi-Party Computation Using Polarizing Cards. - Kazumasa Shinagawa; Takaaki Mizuki; Jacob C. N. Schuldt; Koji Nuida; Naoki Kanayama; Takashi Nishide; Goichiro Hanaoka; Eiji Okamoto (IWSEC, 2015)

Multi-party Computation with Small Shuffle Complexity Using Regular Polygon Cards. - Kazumasa Shinagawa; Takaaki Mizuki; Jacob C. N. Schuldt; Koji Nuida; Naoki Kanayama; Takashi Nishide; Goichiro Hanaoka; Eiji Okamoto (ProvSec, 2015)

Size-Hiding Computation for Multiple Parties. - Kazumasa Shinagawa; Koji Nuida; Takashi Nishide; Goichiro Hanaoka; Eiji Okamoto (ASIACRYPT (2), 2016)

Committed AND protocol using three cards with more handy shuffle. - Kazumasa Shinagawa; Koji Nuida; Takashi Nishide; Goichiro Hanaoka; Eiji Okamoto (ISITA, 2016)

Secure Computation Protocols Using Polarizing Cards. - Kazumasa Shinagawa; Takaaki Mizuki; Jacob C. N. Schuldt; Koji Nuida; Naoki Kanayama; Takashi Nishide; Goichiro Hanaoka; Eiji Okamoto (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2016)

One-time Programs with Cloud Storage and Its Application to Electronic Money. - Takuya Kitamura; Kazumasa Shinagawa; Takashi Nishide; Eiji Okamoto (APKC@AsiaCCS, 2017)

On the Robustness of RSA-OAEP Encryption and RSA-PSS Signatures Against (Malicious) Randomness Failures. - Jacob C. N. Schuldt; Kazumasa Shinagawa (AsiaCCS, 2017)

Card-Based Protocols Using Regular Polygon Cards. - Kazumasa Shinagawa; Takaaki Mizuki; Jacob C. N. Schuldt; Koji Nuida; Naoki Kanayama; Takashi Nishide; Goichiro Hanaoka; Eiji Okamoto (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2017)

Card-based Protocols Using Triangle Cards. - Kazumasa Shinagawa; Takaaki Mizuki (FUN, 2018)

The Six-Card Trick: Secure Computation of Three-Input Equality. - Kazumasa Shinagawa; Takaaki Mizuki (ICISC, 2018)

Physical Zero-Knowledge Proof for Makaro. - Xavier Bultel; Jannik Dreier; Jean-Guillaume Dumas; Pascal Lafourcade 001; Daiki Miyahara; Takaaki Mizuki; Atsuki Nagao; Tatsuya Sasaki; Kazumasa Shinagawa; Hideaki Sone (SSS, 2018)

Toward Finite-Runtime Card-Based Protocol for Generating a Hidden Random Permutation without Fixed Points. - Yuji Hashimoto; Koji Nuida; Kazumasa Shinagawa; Masaki Inamura; Goichiro Hanaoka (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2018)

Secure Grouping Protocol Using a Deck of Cards. - Yuji Hashimoto; Kazumasa Shinagawa; Koji Nuida; Masaki Inamura; Goichiro Hanaoka (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2018)

Card-Based Secure Ranking Computations. - Ken Takashima; Yuta Abe; Tatsuya Sasaki; Daiki Miyahara; Kazumasa Shinagawa; Takaaki Mizuki; Hideaki Sone (COCOA, 2019)

Secure Computation of Any Boolean Function Based on Any Deck of Cards. - Kazumasa Shinagawa; Takaaki Mizuki (FAW, 2019)

Light Cryptography. - Pascal Lafourcade 001; Takaaki Mizuki; Atsuki Nagao; Kazumasa Shinagawa (World Conference on Information Security Education, 2019)

Card-Based Cryptography with Invisible Ink. - Kazumasa Shinagawa (TAMC, 2019)

A Single Shuffle Is Enough for Secure Card-Based Computation of Any Circuit. - Kazumasa Shinagawa; Koji Nuida (IACR Cryptol. ePrint Arch., 2019)

Card-Based Covert Lottery. - Yuto Shinoda; Daiki Miyahara; Kazumasa Shinagawa; Takaaki Mizuki; Hideaki Sone (SECITC, 2020)

Card-based protocols for secure ranking computations. - Ken Takashima; Yuta Abe; Tatsuya Sasaki; Daiki Miyahara; Kazumasa Shinagawa; Takaaki Mizuki; Hideaki Sone (Theor. Comput. Sci., 2020)

Card-Based ZKP Protocols for Takuzu and Juosan. - Daiki Miyahara; Léo Robert; Pascal Lafourcade 001; So Takeshige; Takaaki Mizuki; Kazumasa Shinagawa; Atsuki Nagao; Hideaki Sone (FUN, 2021)

Secure Computation with Non-Equivalent Penalties in Constant Rounds. - Takeshi Nakai; Kazumasa Shinagawa (Tokenomics, 2021)

A single shuffle is enough for secure card-based computation of any Boolean circuit. - Kazumasa Shinagawa; Koji Nuida (Discret. Appl. Math., 2021)

Card-based Cryptography with Dihedral Symmetry. - Kazumasa Shinagawa (New Gener. Comput., 2021)

Card-based Cryptographic Protocols for Private Set Intersection. - Anastasiia Doi; Tomoki Ono; Takeshi Nakai; Kazumasa Shinagawa; Yohei Watanabe 001; Koji Nuida; Mitsugu Iwamoto (ISITA, 2022)

Card-Based Secure Sorting Protocol. - Rikuo Haga; Kodai Toyoda; Yuto Shinoda; Daiki Miyahara; Kazumasa Shinagawa; Yuichi Hayashi; Takaaki Mizuki (IWSEC, 2022)

Single-shuffle Full-open Card-based Protocols Imply Private Simultaneous Messages Protocols. - Kazumasa Shinagawa; Koji Nuida (IACR Cryptol. ePrint Arch., 2022)

Graph Automorphism Shuffles from Pile-Scramble Shuffles. - Kengo Miyamoto; Kazumasa Shinagawa (New Gener. Comput., 2022)

Free-XOR in Card-Based Garbled Circuits. - Yoshifumi Manabe; Kazumasa Shinagawa (CANS, 2023)

Single-Shuffle Card-Based Protocols with Six Cards per Gate. - Tomoki Ono; Kazumasa Shinagawa; Takeshi Nakai; Yohei Watanabe 001; Mitsugu Iwamoto (ICISC (2), 2023)

Malicious Player Card-Based Cryptographic Protocols with a Standard Deck of Cards Using Private Operations. - Tomoya Morooka; Yoshifumi Manabe; Kazumasa Shinagawa (ISPEC, 2023)

Uniform Cyclic Group Factorizations of Finite Groups. - Kazuki Kanai; Kengo Miyamoto; Koji Nuida; Kazumasa Shinagawa (CoRR, 2023)

Explicit Lower Bounds for Communication Complexity of PSM for Concrete Functions. - Kazumasa Shinagawa; Koji Nuida (IACR Cryptol. ePrint Arch., 2023)

Automorphism Shuffles for Graphs and Hypergraphs and Its Applications. - Kazumasa Shinagawa; Kengo Miyamoto (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2023)

Constant-round linear-broadcast secure computation with penalties. - Takeshi Nakai; Kazumasa Shinagawa (Theor. Comput. Sci., 2023)

Private simultaneous messages based on quadratic residues. - Kazumasa Shinagawa; Reo Eriguchi; Shohei Satake; Koji Nuida (Des. Codes Cryptogr., 2023)

Size-Hiding Computation in the Honest-But-Curious Model. - Kazumasa Shinagawa (ACISP (2), 2024)

Efficient Card-Based Protocols for Symmetric Functions Using Four-Colored Decks. - Yoshihiro Takahashi; Kazumasa Shinagawa; Hayato Shikata; Takaaki Mizuki (APKC@AsiaCCS, 2024)

Card-Based Cryptography Meets Differential Privacy. - Reo Eriguchi; Kazumasa Shinagawa; Takao Murakami (FUN, 2024)

How to Covertly and Uniformly Scramble the 15 Puzzle and Rubik's Cube. - Kazumasa Shinagawa; Kazuki Kanai; Kengo Miyamoto; Koji Nuida (FUN, 2024)

Card-Based Protocols with Single-Card Encoding. - Kazumasa Shinagawa (ICTAC, 2024)

Efficient Card-Based Protocols with a Standard Deck of Playing Cards Using Partial Opening. - Yoshiaki Honda; Kazumasa Shinagawa (IWSEC, 2024)

Coin-Based Cryptographic Protocols without Hand Operations. - Yuta Minamikawa; Kazumasa Shinagawa (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2024)

Card-Based Protocols for Private Set Intersection and Union. - Anastasiia Doi; Tomoki Ono; Yoshiki Abe; Takeshi Nakai; Kazumasa Shinagawa; Yohei Watanabe 001; Koji Nuida; Mitsugu Iwamoto (New Gener. Comput., 2024)

Physical Zero-Knowledge Proof for Sukoro. - Shun Sasaki; Kazumasa Shinagawa (New Gener. Comput., 2024)

Extended Addition Protocol and Efficient Voting Protocols Using Regular Polygon Cards. - Yoshihiro Takahashi; Kazumasa Shinagawa (New Gener. Comput., 2024)

Secure multi-party computation with legally-enforceable fairness. - Takeshi Nakai; Kazumasa Shinagawa (Int. J. Inf. Sec., 2024)

Formal Verification and Proof of Impossibility for Four-Card XOR Protocols Using Only Random Cuts. - Kazuhiro Fujita; Shota Ikeda; Kazumasa Shinagawa; Kazuki Yoneyama (APKC@AsiaCCS, 2025)

Efficient Multiparty Private Simultaneous Messages for Symmetric Functions. - Reo Eriguchi; Kazumasa Shinagawa (EUROCRYPT (5), 2025)

Only Two Shuffles Perform Card-Based Zero-Knowledge Proof for Sudoku of Any Size. - Kodai Tanaka; Shun Sasaki; Kazumasa Shinagawa; Takaaki Mizuki (SOSA, 2025)

Card-Based Protocols Imply PSM Protocols. - Kazumasa Shinagawa; Koji Nuida (STACS, 2025)

Visualizing differentially private mechanisms with physical cards. - Reo Eriguchi; Kazumasa Shinagawa; Takao Murakami (Theor. Comput. Sci., 2025)

Simulating Virtual Players for UNO without Computers. - Suthee Ruangwises; Kazumasa Shinagawa (CoRR, 2025)

How to Play Old Maid with Virtual Players. - Kazumasa Shinagawa; Daiki Miyahara; Takaaki Mizuki (Theory Comput. Syst., 2025)

Correction to: How to Play Old Maid with Virtual Players. - Kazumasa Shinagawa; Daiki Miyahara; Takaaki Mizuki (Theory Comput. Syst., 2025)

A Note on Single-Cut Full-Open Protocols. - Kazumasa Shinagawa; Koji Nuida (CoRR, 2025)

Cyclic Equalizability of Words and Its Application to Card-Based Cryptography. - Kazumasa Shinagawa; Koji Nuida (CoRR, 2025)