| Efficient card-based cryptographic protocols for millionaires’ problem utilizing private permutations T Nakai, Y Tokushige, Y Misawa, M Iwamoto, K Ohta Cryptology and Network Security: 15th International Conference, CANS 2016 …, 2016 | 44 | 2016 |
| Four cards are sufficient for a card-based three-input voting protocol utilizing private permutations T Nakai, S Shirouchi, M Iwamoto, K Ohta Information Theoretic Security: 10th International Conference, ICITS 2017 …, 2017 | 32 | 2017 |
| How to solve millionaires’ problem with two kinds of cards T Nakai, Y Misawa, Y Tokushige, M Iwamoto, K Ohta New Generation Computing 39, 73-96, 2021 | 28 | 2021 |
| Secure computation for threshold functions with physical cards: power of private permutations T Nakai, S Shirouchi, Y Tokushige, M Iwamoto, K Ohta New Generation Computing 40 (1), 95-113, 2022 | 12 | 2022 |
| Efficient card-based majority voting protocols Y Abe, T Nakai, Y Kuroki, S Suzuki, Y Koga, Y Watanabe, M Iwamoto, ... New Generation Computing 40 (1), 173-198, 2022 | 10 | 2022 |
| Efficient card-based cryptographic protocols for logic gates utilizing private permutations S Shirouchi, T Nakai, M Iwamoto, K Ohta Proc. of 2017 Symposium on Cryptography and Information Security (SCIS 2017 …, 2017 | 9 | 2017 |
| How to make a secure index for searchable symmetric encryption, revisited Y Watanabe, T Nakai, K Ohara, T Nojima, Y Liu, M Iwamoto, K Ohta IEICE Transactions on Fundamentals of Electronics, Communications and …, 2022 | 4 | 2022 |
| Constant-round linear-broadcast secure computation with penalties T Nakai, K Shinagawa Theoretical Computer Science 959, 113874, 2023 | 2 | 2023 |
| Secure computation with non-equivalent penalties in constant rounds T Nakai, K Shinagawa 3rd International Conference on Blockchain Economics, Security and Protocols …, 2022 | 2 | 2022 |
| Secure Multi-party Computation with Legally-Enforceable Fairness T Nakai, K Shinagawa International Conference on Information and Communications Security, 161-178, 2023 | 1 | 2023 |
| The Two Sheriffs Problem: Cryptographic Formalization and Generalization K Sugimoto, T Nakai, Y Watanabe, M Iwamoto International Conference on Combinatorial Optimization and Applications, 512-523, 2023 | | 2023 |
| Single-Shuffle Card-Based Protocols with Six Cards per Gate T Ono, K Shinagawa, T Nakai, Y Watanabe, M Iwamoto International Conference on Information Security and Cryptology, 157-169, 2023 | | 2023 |
| Constant-Deposit Multiparty Lotteries on Bitcoin for Arbitrary Number of Players and Winners S Uchizono, T Nakai, Y Watanabe, M Iwamoto International Conference on Information Security and Cryptology, 133-156, 2023 | | 2023 |
| A Computationally Efficient Card-Based Majority Voting Protocol with Fewer Cards in the Private Model Y Abe, T Nakai, Y Watanabe, M Iwamoto, K Ohta IEICE Transactions on Fundamentals of Electronics, Communications and …, 2023 | | 2023 |
| Private Permutations in Card-based Cryptography 中井雄士， ナカイタケシ | | 2021 |
| A Note on Acceptable Information Leakage of Searchable Symmetric Encryption T Nakai, T Nojima, M Iwamoto, K Ohta IEICE Technical Report; IEICE Tech. Rep. 116 (505), 187-193, 2017 | | 2017 |
Mitsugu IwamotoThe University of Electro-CommunicationsGeverifieerd e-mailadres voor uec.ac.jp
