VLDB 2026 Research / reviewers in the wild / expert
Susumu Kiyoshima
dblp:11/11286
· DBLP profile ↗
23ranked-venue papers
19as first author
8since 2021 · last 2026
0009-0002-9077-9048ORCID · reported
Domains — the database's venue-derived domains; a paper can count in several
Security and privacy · 22 · 19 first-author · 8 since 2021Theory of computation · 8 · 7 first-author · 3 since 2021
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | Public-Coin Three-Round Zero-Knowledge from Learning with Errors and Keyless Multi-Collision-Resistant Hash
Susumu Kiyoshima |
J. Cryptol. | 1 |
| 2025 | Four-Round Statistical Non-malleable Zero-Knowledge
Susumu Kiyoshima |
TCC (4) | 1 |
| 2024 | Resettable Statistical Zero-Knowledge for $\ensuremath {\textsf{NP}}$
Susumu Kiyoshima |
CRYPTO (9) | 1 |
| 2023 | Holographic SNARGs for P and Batch-NP from (Polynomially Hard) Learning with Errors
Susumu Kiyoshima |
TCC (3) | 1 |
| 2023 | No-Signaling Linear PCPs
Susumu Kiyoshima |
J. Cryptol. | 1 |
| 2022 | Public-Coin 3-Round Zero-Knowledge from Learning with Errors and Keyless Multi-Collision-Resistant Hash
Susumu Kiyoshima |
CRYPTO (1) | 1 |
| 2022 | Constant-Round Leakage-Resilient Zero-Knowledge from Collision Resistance
Susumu Kiyoshima |
J. Cryptol. | 1 |
| 2021 | Black-Box Impossibilities of Obtaining 2-Round Weak ZK and Strong WI from Polynomial Hardness
Susumu Kiyoshima |
TCC (1) | 1 |
| 2020 | Round-Optimal Black-Box Commit-and-Prove with Succinct Communication
Susumu Kiyoshima |
CRYPTO (2) | 1 |
| 2020 | Statistical Concurrent Non-Malleable Zero-Knowledge from One-Way Functions
Susumu Kiyoshima |
J. Cryptol. | 1 |
| 2019 | Round-Efficient Black-Box Construction of Composable Multi-Party Computation
Susumu Kiyoshima |
J. Cryptol. | 1 |
| 2019 | Non-black-box Simulation in the Fully Concurrent Setting, Revisited
Susumu Kiyoshima |
J. Cryptol. | 1 |
| 2018 | A New Approach to Black-Box Concurrent Secure Computation
Sanjam Garg, Susumu Kiyoshima, Omkant Pandey |
EUROCRYPT (2) | 2 |
| 2018 | No-signaling Linear PCPs
Susumu Kiyoshima |
TCC (1) | 1 |
| 2017 | On the Exact Round Complexity of Self-composable Two-Party Computation
Sanjam Garg, Susumu Kiyoshima, Omkant Pandey |
EUROCRYPT (2) | 2 |
| 2017 | A Unified Approach to Constructing Black-Box UC Protocols in Trusted Setup Models
Susumu Kiyoshima, Huijia Lin, Muthuramakrishnan Venkitasubramaniam |
TCC (1) | 1 |
| 2016 | Constant-Round Leakage-Resilient Zero-Knowledge from Collision Resistance
Susumu Kiyoshima |
EUROCRYPT (2) | 1 |
| 2015 | Garbling Scheme for Formulas with Constant Size of Garbled Gates
Carmen Kempka, Ryo Kikuchi, Susumu Kiyoshima, Koutarou Suzuki |
ASIACRYPT (1) | 3 |
| 2015 | Statistical Concurrent Non-malleable Zero-Knowledge from One-Way Functions
Susumu Kiyoshima |
CRYPTO (2) | 1 |
| 2015 | An Alternative Approach to Non-black-box Simulation in Fully Concurrent Setting
Susumu Kiyoshima |
TCC (1) | 1 |
| 2014 | Round-Efficient Black-Box Construction of Composable Multi-Party Computation
Susumu Kiyoshima |
CRYPTO (2) | 1 |
| 2014 | Constant-Round Black-Box Construction of Composable Multi-Party Computation Protocol
Susumu Kiyoshima, Yoshifumi Manabe, Tatsuaki Okamoto |
TCC | 1 |
| 2012 | Constant-Time Approximation Algorithms for the Knapsack Problem
Hiro Ito, Susumu Kiyoshima, Yuichi Yoshida |
TAMC | 2 |