Takeshi Nakai

According to our database, Takeshi Nakai authored at least 13 papers between 2016 and 2023.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2023

Constant-round linear-broadcast secure computation with penalties.

Takeshi Nakai, Kazumasa Shinagawa

Theor. Comput. Sci., May, 2023

A Computationally Efficient Card-Based Majority Voting Protocol with Fewer Cards in the Private Model.

Yoshiki Abe, Takeshi Nakai, Yohei Watanabe, Mitsugu Iwamoto, Kazuo Ohta

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., March, 2023

Constant-Deposit Multiparty Lotteries on Bitcoin for Arbitrary Number of Players and Winners.

Shun Uchizono, Takeshi Nakai, Yohei Watanabe, Mitsugu Iwamoto

Proceedings of the Information Security and Cryptology - ICISC 2023, 2023

Single-Shuffle Card-Based Protocols with Six Cards per Gate.

Tomoki Ono, Kazumasa Shinagawa, Takeshi Nakai, Yohei Watanabe, Mitsugu Iwamoto

Proceedings of the Information Security and Cryptology - ICISC 2023, 2023

Secure Multi-party Computation with Legally-Enforceable Fairness.

Takeshi Nakai, Kazumasa Shinagawa

Proceedings of the Information and Communications Security - 25th International Conference, 2023

The Two Sheriffs Problem: Cryptographic Formalization and Generalization.

Kota Sugimoto, Takeshi Nakai, Yohei Watanabe, Mitsugu Iwamoto

Proceedings of the Combinatorial Optimization and Applications, 2023

2022

How to Make a Secure Index for Searchable Symmetric Encryption, Revisited.

Yohei Watanabe, Takeshi Nakai, Kazuma Ohara, Takuya Nojima, Yexuan Liu, Mitsugu Iwamoto, Kazuo Ohta

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., December, 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

Efficient Card-Based Majority Voting Protocols.

Yoshiki Abe, Takeshi Nakai, Yoshihisa Kuroki, Shinnosuke Suzuki, Yuta Koga, Yohei Watanabe, Mitsugu Iwamoto, Kazuo Ohta

New Gener. Comput., 2022

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

Secure Computation with Non-Equivalent Penalties in Constant Rounds.

Takeshi Nakai, Kazumasa Shinagawa

Proceedings of the 3rd International Conference on Blockchain Economics, 2021

2017

Four Cards Are Sufficient for a Card-Based Three-Input Voting Protocol Utilizing Private Permutations.

Takeshi Nakai, Satoshi Shirouchi, Mitsugu Iwamoto, Kazuo Ohta

Proceedings of the Information Theoretic Security - 10th International Conference, 2017

2016

Efficient Card-Based Cryptographic Protocols for Millionaires' Problem Utilizing Private Permutations.

Takeshi Nakai, Yuuki Tokushige, Yuto Misawa, Mitsugu Iwamoto, Kazuo Ohta

Proceedings of the Cryptology and Network Security - 15th International Conference, 2016