Susumu Kiyoshima

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