| 2025 | TCC | Four-Round Statistical Non-malleable Zero-Knowledge. | Susumu Kiyoshima |
| 2024 | CRYPTO | Resettable Statistical Zero-Knowledge for $\ensuremath {\textsf{NP}}$. | Susumu Kiyoshima |
| 2023 | TCC | Holographic SNARGs for P and Batch-NP from (Polynomially Hard) Learning with Errors. | Susumu Kiyoshima |
| 2022 | CRYPTO | Public-Coin 3-Round Zero-Knowledge from Learning with Errors and Keyless Multi-Collision-Resistant Hash. | Susumu Kiyoshima |
| 2021 | TCC | Black-Box Impossibilities of Obtaining 2-Round Weak ZK and Strong WI from Polynomial Hardness. | Susumu Kiyoshima |
| 2020 | CRYPTO | Round-Optimal Black-Box Commit-and-Prove with Succinct Communication. | Susumu Kiyoshima |
| 2018 | EuroCrypt | A New Approach to Black-Box Concurrent Secure Computation. | Sanjam Garg, Susumu Kiyoshima, Omkant Pandey |
| 2018 | TCC | No-signaling Linear PCPs. | Susumu Kiyoshima |
| 2017 | EuroCrypt | On the Exact Round Complexity of Self-composable Two-Party Computation. | Sanjam Garg, Susumu Kiyoshima, Omkant Pandey |
| 2017 | TCC | A Unified Approach to Constructing Black-Box UC Protocols in Trusted Setup Models. | Susumu Kiyoshima, Huijia Lin, Muthuramakrishnan Venkitasubramaniam |
| 2016 | EuroCrypt | Constant-Round Leakage-Resilient Zero-Knowledge from Collision Resistance. | Susumu Kiyoshima |
| 2015 | ASIACRYPT | Garbling Scheme for Formulas with Constant Size of Garbled Gates. | Carmen Kempka, Ryo Kikuchi, Susumu Kiyoshima, Koutarou Suzuki |
| 2015 | CRYPTO | Statistical Concurrent Non-malleable Zero-Knowledge from One-Way Functions. | Susumu Kiyoshima |
| 2015 | TCC | An Alternative Approach to Non-black-box Simulation in Fully Concurrent Setting. | Susumu Kiyoshima |
| 2014 | CRYPTO | Round-Efficient Black-Box Construction of Composable Multi-Party Computation. | Susumu Kiyoshima |
| 2014 | TCC | Constant-Round Black-Box Construction of Composable Multi-Party Computation Protocol. | Susumu Kiyoshima, Yoshifumi Manabe, Tatsuaki Okamoto |
| 2012 | IWSEC | Efficient Concurrent Oblivious Transfer in Super-Polynomial-Simulation Security. | Susumu Kiyoshima, Yoshifumi Manabe, Tatsuaki Okamoto |
| 2012 | TAMC | Constant-Time Approximation Algorithms for the Knapsack Problem. | Hiro Ito, Susumu Kiyoshima, Yuichi Yoshida |