Takeshi Nakai

2011/4  –  2015/3

　B.S. Engineering from The University of Electro-Communications 

2015/4  –  2017/3 

　M.S. Engineering from The University of Electro-Communications (Ohta-Iwamoto Laboratory)

2017/4  –  2020/3 

　SCSK Corporation 

2020/4  –  2021/3 

　Ph.D. in Engineering from The University of Electro-Communications (Iwamoto-Watanabe Laboratory)

　    Dissertation: Private Permutations in Card-Based Cryptography

　JSPS Research Fellow DC1 (Iwamoto-Watanabe Laboratory in The University of Electro-Communications) 

2021/4  –  2022/3 

　JSPS Research Fellow PD (Iwamoto-Watanabe Laboratory in The University of Electro-Communications) 

2022/4  –  present 

　Assistant Professor, Department of Computer Science and Engineering, Toyohashi University of Technology [Lab. Homepage] 

Journal Articles (Refereed)

1. Constant-Round Linear-Broadcast Secure Computation with Penalties
   T. Nakai and K. Shinagawa, Theoretical Computer Science, vol. 959, Elsevier, 2023. [arXiv ver.]

2. A Computationally Efficient Card-Based Majority Voting Protocol with Fewer Cards in the Private Model
   Y. Abe, T. Nakai, Y. Watanabe, M. Iwamoto, and K. Ohta, IEICE Transactions on Fundamentals, IEICE, vol. E106.A, pages 315-324, IEICE, 2023. 

3. How to Make a Secure Index for Searchable Symmetric Encryption, Revisited
   Y. Watanabe, T. Nakai, K. Ohara, T. Nojima, Y. Liu, M. Iwamoto, and K. Ohta, IEICE Transactions on Fundamentals, vol. E105.A, pages 1559-1577, IEICE, 2022.  [eprint ver.]

4. Efficient Card-based Majority Voting Protocols
   Y. Abe, T. Nakai, Y. Kuroki, S. Suzuki, Y. Koga, Y. Watanabe, M. Iwamoto, and K. Ohta, New Generation Computing, vol. 40, pages 173-198, Springer, 2022.

5. Secure Computation for Threshold Functions with Physical Cards: Power of Private Permutations
   T. Nakai, S. Shirouchi, Y. Tokushige, M. Iwamoto, and K. Ohta,  New Generation Computing, Springer, vol. 40, pages 95-113, Springer, 2022.

6. How to Solve Millionaires’ Problem with Two Kinds of Cards
   T. Nakai, Y. Misawa, Y. Tokushige, M. Iwamoto, and K. Ohta, New Generation Computing, vol. 39, pages 73-96, Springer, 2021.

International Conference (Refereed)

1. Constant-Deposit Multiparty Lotteries on Bitcoin for Arbitrary Number of Players and Winners
   S. Uchizono, T. Nakai, Y. Watanabe and M. Iwamoto, 26th Annual International Conference on Information Security and Cryptography (ICISC 2023), LNCS, 14562, pages 133-156, Springer, 2024.

2. Single-Shuffle Card-Based Protocols with Six Cards per Gate
   T. Ono, K. Shinagawa, T. Nakai, Y. Watanabe, M. Iwamoto, 26th Annual International Conference on Information Security and Cryptography (ICISC 2023), LNCS, 14562, pages 157-169, Springer, 2024.

3. The Two Sheriffs Problem: Cryptographic Formalization and Generalization
   K. Sugimoto, T. Nakai, Y. Watanabe, M. Iwamoto, 16th Annual International Conference on Combinatorial Optimization and Applications (COCOA 2023), LNCS, 14461, pages 512-523, Springer, 2023.

4. Secure Multi-Party Computation with Legally-Enforceable Fairness

T. Nakai and K. Shinagawa, 25th International Conference on Information and Communications Security (ICICS 2023), LNCS 14252, pages 161-178, Springer, 2023. 

5. An Improvement of Multi-Party Private Set Intersection Based on Oblivious Programmable PRFs
   S. Shimizu, T. Nakai, Y. Watanabe, and M. Iwamoto, 2022 International Symposium on Information Theory and its Applications (ISITA 2022), to appear. 

6. Card-based Cryptographic Protocols for Private Set Intersection
   A. Doi, T. Ono, T. Nakai, K. Shinagawa, Y. Watanabe, K. Nuida, and M. Iwamoto, 2022 International Symposium on Information Theory and its Applications (ISITA 2022), to appear. 

7. Secure Computation with Non-equivalent Penalties in Constant Rounds
   T. Nakai and K. Shinagawa, 3rd International Conference on Blockchain Economics, Security and Protocols (Tokenomics 2021), Open Access Series in Informatics (OASIcs), vol. 97, pages 5:1-5:16, Schloss Dagstuhl, 2022. 

8. Four Cards Are Enough for Card-Based Three-Input Voting Protocol Utilizing Private Permutations
   T. Nakai, S. Shirouchi, Y. Tokushige, M. Iwamoto, and K. Ohta, 10th International Conference on Information Theoretic Security (ICITS 2017), LNCS 10681, pages 153-165, Springer, 2017.

9. Efficient Card-Based Cryptographic Protocols for Millionaires’ Problem Utilizing Private Permutations
   T. Nakai, Y. Misawa, Y. Tokushige, M. Iwamoto, and K. Ohta, 15th International Conference on Cryptology and Network Security (CANS 2016), LNCS 10052, pages 350-364, Springer, 2016.

1. 2022/1: SCIS Paper Award

2. 2017/3: The University of Electro-Communications Student Award

3. 2015/3: The University of Electro-Communications Meguro-Kai Award

• Information Processing Society of Japan (IPSJ)

• The Institute of Electronics, Information and Communication Engineers (IEICE)

• The International Association for Cryptologic Research (IACR)

• CSS2023 (Program Committee)

• IWSEC2023 (Local Organizing Committee)

• ICAICTA2022 (Local Arrangement Chairs)

• IWSEC2022 (Local Organizing Committee)