Efficient Concurrent Oblivious Transfer in Super-Polynomial-Simulation Security. - Susumu Kiyoshima; Yoshifumi Manabe; Tatsuaki Okamoto (IWSEC, 2012)

Constant-Time Approximation Algorithms for the Knapsack Problem. - Hiro Ito; Susumu Kiyoshima; Yuichi Yoshida (TAMC, 2012)

Constant-Round Black-Box Construction of Composable Multi-Party Computation Protocol. - Susumu Kiyoshima; Yoshifumi Manabe; Tatsuaki Okamoto (IACR Cryptol. ePrint Arch., 2013)

An Alternative Approach to Non-black-box Simulation in Fully Concurrent Setting. - Susumu Kiyoshima (IACR Cryptol. ePrint Arch., 2015)

Garbling Scheme for Formulas with Constant Size of Garbled Gates. - Carmen Kempka; Ryo Kikuchi; Susumu Kiyoshima; Koutarou Suzuki (IACR Cryptol. ePrint Arch., 2016)

On the Exact Round Complexity of Self-Composable Two-Party Computation. - Sanjam Garg; Susumu Kiyoshima; Omkant Pandey (IACR Cryptol. ePrint Arch., 2017)

A Unified Approach to Constructing Black-box UC Protocols in Trusted Setup Models. - Susumu Kiyoshima; Huijia Lin; Muthuramakrishnan Venkitasubramaniam (IACR Cryptol. ePrint Arch., 2017)

A New Approach to Black-Box Concurrent Secure Computation. - Sanjam Garg; Susumu Kiyoshima; Omkant Pandey (IACR Cryptol. ePrint Arch., 2018)

Round-Efficient Black-Box Construction of Composable Multi-Party Computation. - Susumu Kiyoshima (J. Cryptol., 2019)

Non-black-box Simulation in the Fully Concurrent Setting, Revisited. - Susumu Kiyoshima (J. Cryptol., 2019)

Round-optimal Black-box Commit-and-prove with Succinct Communication. - Susumu Kiyoshima (IACR Cryptol. ePrint Arch., 2020)

Statistical Concurrent Non-Malleable Zero-Knowledge from One-Way Functions. - Susumu Kiyoshima (J. Cryptol., 2020)

Black-Box Impossibilities of Obtaining 2-Round Weak ZK and Strong WI from Polynomial Hardness. - Susumu Kiyoshima (IACR Cryptol. ePrint Arch., 2021)

Public-Coin 3-Round Zero-Knowledge from Learning with Errors and Keyless Multi-Collision-Resistant Hash. - Susumu Kiyoshima (IACR Cryptol. ePrint Arch., 2022)

Constant-Round Leakage-Resilient Zero-Knowledge from Collision Resistance. - Susumu Kiyoshima (J. Cryptol., 2022)

Holographic SNARGs for P and Batch-NP from (Polynomially Hard) Learning with Errors. - Susumu Kiyoshima (IACR Cryptol. ePrint Arch., 2023)

No-Signaling Linear PCPs. - Susumu Kiyoshima (J. Cryptol., 2023)

Resettable Statistical Zero-Knowledge for $ ensuremath { textsf{NP}}$. - Susumu Kiyoshima (CRYPTO (9), 2024)

Resettable Statistical Zero-Knowledge for NP. - Susumu Kiyoshima (IACR Cryptol. ePrint Arch., 2024)