| Constant-round black-box construction of composable multi-party computation protocol S Kiyoshima, Y Manabe, T Okamoto Theory of Cryptography Conference (TCC), 343-367, 2014 | 30 | 2014 |
| On the Exact Round Complexity of Self-Composable Two-Party Computation S Garg, S Kiyoshima, O Pandey Advances in Cryptology – EUROCRYPT 2017, 194-224, 2017 | 18 | 2017 |
| Constant-time approximation algorithms for the knapsack problem H Ito, S Kiyoshima, Y Yoshida Theory and Applications of Models of Computation, 131-142, 2012 | 12 | 2012 |
| A New Approach to Black-Box Concurrent Secure Computation S Garg, S Kiyoshima, O Pandey Advances in Cryptology – EUROCRYPT 2018, 566-599, 2018 | 9 | 2018 |
| Round-Optimal Black-Box Commit-and-Prove with Succinct Communication S Kiyoshima Advances in Cryptology – CRYPTO 2020, 533-561, 2020 | 8 | 2020 |
| A Unified Approach to Constructing Black-Box UC Protocols in Trusted Setup Models S Kiyoshima, H Lin, M Venkitasubramaniam Theory of Cryptography Conference (TCC), 776-809, 2017 | 6 | 2017 |
| Garbling scheme for formulas with constant size of garbled gates C Kempka, R Kikuchi, S Kiyoshima, K Suzuki Advances in Cryptology – ASIACRYPT 2015, 758-782, 2015 | 5 | 2015 |
| No-signaling linear PCPs S Kiyoshima Theory of Cryptography Conference (TCC), 67-97, 2018 | 4 | 2018 |
| Public-Coin 3-Round Zero-Knowledge from Learning with Errors and Keyless Multi-Collision-Resistant Hash S Kiyoshima Advances in Cryptology – CRYPTO 2022, 444-473, 2022 | 2 | 2022 |
| Constant-round leakage-resilient zero-knowledge from collision resistance S Kiyoshima Advances in Cryptology – EUROCRYPT 2016, 93-123, 2016 | 2 | 2016 |
| Statistical concurrent non-malleable zero-knowledge from one-way functions S Kiyoshima Advances in Cryptology – CRYPTO 2015, 85-106, 2015 | 2 | 2015 |
| An Alternative Approach to Non-black-box Simulation in Fully Concurrent Setting S Kiyoshima Theory of Cryptography Conference (TCC), 290-318, 2015 | 2 | 2015 |
| Black-Box Impossibilities of Obtaining 2-Round Weak ZK and Strong WI from Polynomial Hardness S Kiyoshima Theory of Cryptography Conference (TCC), 369-400, 2021 | 1 | 2021 |
| Statistical Concurrent Non-Malleable Zero-Knowledge from One-Way Functions S Kiyoshima Journal of Cryptology 33 (3), 1318-1361, 2020 | 1 | 2020 |
| Non-black-box Simulation in the Fully Concurrent Setting, Revisited S Kiyoshima Journal of Cryptology 32 (2), 393-434, 2019 | 1 | 2019 |
| No-Signaling Linear PCPs S Kiyoshima Journal of Cryptology 36 (2), 9, 2023 | | 2023 |
| Constant-Round Leakage-Resilient Zero-Knowledge from Collision Resistance S Kiyoshima Journal of Cryptology 35 (3), 16, 2022 | | 2022 |
| Constant-Round Leakage-Resilient Zero-Knowledge from Collision Resistance S Kiyoshima Journal of Cryptology 35 (3), 1-41, 2022 | | 2022 |
| Statistical Concurrent Non-Malleable Zero-Knowledge from One-Way Functions S Kiyoshima Journal of Cryptology 33 (3), 1318-1361, 2020 | | 2020 |
| Round-Efficient Black-Box Construction of Composable Multi-Party Computation S Kiyoshima Journal of Cryptology 32, 178-238, 2019 | | 2019 |
Yoshifumi ManabeKogakuin UniversityVerified email at cc.kogakuin.ac.jp
