Demo Data from SIGIR 2026 / 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
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Network and information security
15 papers |
Cryptographic protocols and secure computation · 92% Cryptographic primitives and cryptanalysis · 8% |
Topics — the 19 heaviest of 20, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Cryptographic protocols and secure computation › proof systems
zero-knowledge proofs |
4.2 | 8 | 2026 | Public-Coin Three-Round Zero-Knowledge from Learning with Errors and Keyless Multi-Collision-Resistant Hash · J. Cryptol. 2026 Resettable Statistical Zero-Knowledge for $\ensuremath {\textsf{NP}}$ · CRYPTO (9) 2024 Constant-Round Leakage-Resilient Zero-Knowledge from Collision Resistance · J. Cryptol. 2022 |
Cryptographic protocols and secure computation › proof systems › zero-knowledge proofs › zero-knowledge interactive proof
public-coin zero-knowledge |
1.6 | 2 | 2026 | Public-Coin Three-Round Zero-Knowledge from Learning with Errors and Keyless Multi-Collision-Resistant Hash · J. Cryptol. 2026 Public-Coin 3-Round Zero-Knowledge from Learning with Errors and Keyless Multi-Collision-Resistant Hash · CRYPTO (1) 2022 |
Cryptographic protocols and secure computation
secure multiparty computation |
0.9 | 3 | 2019 | Round-Efficient Black-Box Construction of Composable Multi-Party Computation · J. Cryptol. 2019 A New Approach to Black-Box Concurrent Secure Computation · EUROCRYPT (2) 2018 Round-Efficient Black-Box Construction of Composable Multi-Party Computation · CRYPTO (2) 2014 |
Cryptographic protocols and secure computation › proof systems › zero-knowledge proofs
leakage-resilient zero-knowledge |
0.8 | 2 | 2022 | Constant-Round Leakage-Resilient Zero-Knowledge from Collision Resistance · J. Cryptol. 2022 Constant-Round Leakage-Resilient Zero-Knowledge from Collision Resistance · EUROCRYPT (2) 2016 |
Cryptographic protocols and secure computation › proof systems › zero-knowledge proofs › zero-knowledge interactive proof
resettable zero-knowledge |
0.8 | 1 | 2024 | Resettable Statistical Zero-Knowledge for $\ensuremath {\textsf{NP}}$ · CRYPTO (9) 2024 |
Cryptographic protocols and secure computation › proof systems › zero-knowledge proofs
statistical zero-knowledge |
0.8 | 1 | 2024 | Resettable Statistical Zero-Knowledge for $\ensuremath {\textsf{NP}}$ · CRYPTO (9) 2024 |
Cryptographic protocols and secure computation › proof systems
probabilistically checkable proofs |
0.7 | 1 | 2023 | No-Signaling Linear PCPs · J. Cryptol. 2023 |
Cryptographic protocols and secure computation › proof systems › zero-knowledge proofs
non-malleable zero knowledge |
0.7 | 2 | 2020 | Statistical Concurrent Non-Malleable Zero-Knowledge from One-Way Functions · J. Cryptol. 2020 Statistical Concurrent Non-malleable Zero-Knowledge from One-Way Functions · CRYPTO (2) 2015 |
Cryptographic protocols and secure computation › secure multiparty computation
round complexity |
0.6 | 2 | 2020 | Round-Optimal Black-Box Commit-and-Prove with Succinct Communication · CRYPTO (2) 2020 Round-Efficient Black-Box Construction of Composable Multi-Party Computation · CRYPTO (2) 2014 |
Cryptographic protocols and secure computation › secure computation protocols › round complexity of secure computation
constant-round protocols |
0.6 | 1 | 2022 | Constant-Round Leakage-Resilient Zero-Knowledge from Collision Resistance · J. Cryptol. 2022 |
Cryptographic primitives and cryptanalysis › post-quantum cryptography
lattice-based cryptography |
0.6 | 1 | 2022 | Public-Coin 3-Round Zero-Knowledge from Learning with Errors and Keyless Multi-Collision-Resistant Hash · CRYPTO (1) 2022 |
Cryptographic primitives and cryptanalysis › post-quantum cryptography › lattice-based cryptography
learning with errors |
0.6 | 1 | 2022 | Public-Coin 3-Round Zero-Knowledge from Learning with Errors and Keyless Multi-Collision-Resistant Hash · CRYPTO (1) 2022 |
Cryptographic protocols and secure computation
composable security |
0.4 | 1 | 2019 | Round-Efficient Black-Box Construction of Composable Multi-Party Computation · J. Cryptol. 2019 |
Cryptographic protocols and secure computation › proof systems › zero-knowledge proofs
non-black-box simulation |
0.4 | 1 | 2019 | Non-black-box Simulation in the Fully Concurrent Setting, Revisited · J. Cryptol. 2019 |
Cryptographic protocols and secure computation › secure multiparty computation
concurrent secure computation |
0.3 | 1 | 2018 | A New Approach to Black-Box Concurrent Secure Computation · EUROCRYPT (2) 2018 |
Cryptographic protocols and secure computation › secure computation protocols
round complexity of secure computation |
0.3 | 1 | 2017 | On the Exact Round Complexity of Self-composable Two-Party Computation · EUROCRYPT (2) 2017 |
Cryptographic protocols and secure computation › secure multiparty computation
secure two-party computation |
0.3 | 1 | 2017 | On the Exact Round Complexity of Self-composable Two-Party Computation · EUROCRYPT (2) 2017 |
Cryptographic protocols and secure computation › proof systems › zero-knowledge proofs › zero-knowledge interactive proof
concurrent zero-knowledge |
0.2 | 1 | 2015 | Statistical Concurrent Non-malleable Zero-Knowledge from One-Way Functions · CRYPTO (2) 2015 |
Cryptographic protocols and secure computation
garbled circuits |
0.2 | 1 | 2015 | Garbling Scheme for Formulas with Constant Size of Garbled Gates · ASIACRYPT (1) 2015 |
Methods — techniques the papers use, named apart from their topics
multi-collision-resistant hash · 1.6learning with errors · 1.6black-box construction · 1.0collision resistance · 0.8resettable security · 0.8one-way functions · 0.7succinct communication · 0.4simulation-based security · 0.3statistical zero-knowledge · 0.2garbled circuits · 0.2
| 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 |