Susumu Kiyoshima

Publication Activity (10 Years)

Years Active: 2012-2024
Publications (10 Years): 31

Top Topics

Agnostic Learning

Rule Extraction

Fixed Parameter Tractable

Top Venues

IACR Cryptol. ePrint Arch.

Publications

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