Takeshi Nakai

Publication Activity (10 Years)

Years Active: 2016-2023
Publications (10 Years): 15

Top Topics

Majority Voting

Uci Benchmark Data

Homomorphic Encryption

Top Venues

New Gener. Comput.

IEICE Trans. Fundam. Electron. Commun. Comput. Sci.

Publications

Tomoki Ono, Kazumasa Shinagawa, Takeshi Nakai, Yohei Watanabe, Mitsugu Iwamoto
Single-Shuffle Card-Based Protocols with Six Cards per Gate. ICISC (2) (2023)
Takeshi Nakai, Kazumasa Shinagawa
Secure Multi-party Computation with Legally-Enforceable Fairness. ICICS (2023)
Yoshiki Abe, Takeshi Nakai, Yohei Watanabe, Mitsugu Iwamoto, Kazuo Ohta
A Computationally Efficient Card-Based Majority Voting Protocol with Fewer Cards in the Private Model. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 106 (3) (2023)
Takeshi Nakai, Kazumasa Shinagawa
Constant-round linear-broadcast secure computation with penalties. Theor. Comput. Sci. 959 (2023)
Shun Uchizono, Takeshi Nakai, Yohei Watanabe, Mitsugu Iwamoto
Constant-Deposit Multiparty Lotteries on Bitcoin for Arbitrary Number of Players and Winners. ICISC (2) (2023)
Kota Sugimoto, Takeshi Nakai, Yohei Watanabe, Mitsugu Iwamoto
The Two Sheriffs Problem: Cryptographic Formalization and Generalization. COCOA (1) (2023)
Takeshi Nakai, Satoshi Shirouchi, Yuuki Tokushige, Mitsugu Iwamoto, Kazuo Ohta
Secure Computation for Threshold Functions with Physical Cards: Power of Private Permutations. New Gener. Comput. 40 (1) (2022)
Yohei Watanabe, Takeshi Nakai, Kazuma Ohara, Takuya Nojima, Yexuan Liu, Mitsugu Iwamoto, Kazuo Ohta
How to Make a Secure Index for Searchable Symmetric Encryption, Revisited. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. (12) (2022)
Takeshi Nakai, Kazumasa Shinagawa
Constant-Round Linear-Broadcast Secure Computation with Penalties. CoRR (2022)
Yoshiki Abe, Takeshi Nakai, Yoshihisa Kuroki, Shinnosuke Suzuki, Yuta Koga, Yohei Watanabe, Mitsugu Iwamoto, Kazuo Ohta
Efficient Card-Based Majority Voting Protocols. New Gener. Comput. 40 (1) (2022)
Takeshi Nakai, Yuto Misawa, Yuuki Tokushige, Mitsugu Iwamoto, Kazuo Ohta
How to Solve Millionaires' Problem with Two Kinds of Cards. New Gener. Comput. 39 (1) (2021)
Takeshi Nakai, Kazumasa Shinagawa
Secure Computation with Non-Equivalent Penalties in Constant Rounds. Tokenomics (2021)
Yohei Watanabe, Takeshi Nakai, Kazuma Ohara, Takuya Nojima, Yexuan Liu, Mitsugu Iwamoto, Kazuo Ohta
How to Make a Secure Index for Searchable Symmetric Encryption, Revisited. IACR Cryptol. ePrint Arch. 2021 (2021)
Takeshi Nakai, Satoshi Shirouchi, Mitsugu Iwamoto, Kazuo Ohta
Four Cards Are Sufficient for a Card-Based Three-Input Voting Protocol Utilizing Private Permutations. ICITS (2017)
Takeshi Nakai, Yuuki Tokushige, Yuto Misawa, Mitsugu Iwamoto, Kazuo Ohta
Efficient Card-Based Cryptographic Protocols for Millionaires' Problem Utilizing Private Permutations. CANS (2016)