Efficient Card-Based Cryptographic Protocols for Millionaires' Problem Utilizing Private Permutations. - Takeshi Nakai; Yuuki Tokushige; Yuto Misawa; Mitsugu Iwamoto; Kazuo Ohta (CANS, 2016)

Four Cards Are Sufficient for a Card-Based Three-Input Voting Protocol Utilizing Private Permutations. - Takeshi Nakai; Satoshi Shirouchi; Mitsugu Iwamoto; Kazuo Ohta (ICITS, 2017)

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

How to Solve Millionaires' Problem with Two Kinds of Cards. - Takeshi Nakai; Yuto Misawa; Yuuki Tokushige; Mitsugu Iwamoto; Kazuo Ohta (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)

An Improvement of Multi-Party Private Set Intersection Based on Oblivious Programmable PRFs. - Seiya Shimizu; Takeshi Nakai; Yohei Watanabe 001; Mitsugu Iwamoto (ISITA, 2022)

Efficient Card-Based Majority Voting Protocols. - Yoshiki Abe; Takeshi Nakai; Yoshihisa Kuroki; Shinnosuke Suzuki; Yuta Koga; Yohei Watanabe 001; Mitsugu Iwamoto; Kazuo Ohta (New Gener. Comput., 2022)

Secure Computation for Threshold Functions with Physical Cards: Power of Private Permutations. - Takeshi Nakai; Satoshi Shirouchi; Yuuki Tokushige; Mitsugu Iwamoto; Kazuo Ohta (New Gener. Comput., 2022)

How to Make a Secure Index for Searchable Symmetric Encryption, Revisited. - Yohei Watanabe 001; Takeshi Nakai; Kazuma Ohara; Takuya Nojima; Yexuan Liu; Mitsugu Iwamoto; Kazuo Ohta (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2022)

The Two Sheriffs Problem: Cryptographic Formalization and Generalization. - Kota Sugimoto; Takeshi Nakai; Yohei Watanabe 001; Mitsugu Iwamoto (COCOA (1), 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)

Constant-Deposit Multiparty Lotteries on Bitcoin for Arbitrary Number of Players and Winners. - Shun Uchizono; Takeshi Nakai; Yohei Watanabe 001; Mitsugu Iwamoto (ICISC (2), 2023)

A Computationally Efficient Card-Based Majority Voting Protocol with Fewer Cards in the Private Model. - Yoshiki Abe; Takeshi Nakai; Yohei Watanabe 001; Mitsugu Iwamoto; Kazuo Ohta (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2023)

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

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)

Card-based Cryptography with a Standard Deck of Cards, Revisited: Efficient Protocols in the Private Model. - Takeshi Nakai; Keita Iwanari; Tomoki Ono; Yoshiki Abe; Yohei Watanabe 001; Mitsugu Iwamoto (New Gener. Comput., 2024)

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

Secure Computation with Penalties, Revisited: How to Handle Coins with Various Colors. - Takeshi Nakai (CT-RSA, 2025)