Demo Data from SIGIR 2026 / reviewers in the wild / expert
Janno Siim
dblp:209/1796
· DBLP profile ↗
11ranked-venue papers
0as first author
8since 2021 · last 2026
0000-0001-5824-7215ORCID · verified
Domains — the database's venue-derived domains; a paper can count in several
Security and privacy · 11 · 8 since 2021Theory of computation · 1 · 1 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
8 papers |
Cryptographic protocols and secure computation · 93% Cryptographic primitives and cryptanalysis · 7% |
Topics — the 11 heaviest of 11, 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 |
3.3 | 6 | 2026 | Special Soundness and Binding Properties: A Framework for Tightly Secure zk-SNARKs · EUROCRYPT (7) 2026 Constant-Size zk-SNARKs in ROM from Falsifiable Assumptions · EUROCRYPT (6) 2024 Counting Vampires: From Univariate Sumcheck to Updatable ZK-SNARK · ASIACRYPT (2) 2022 |
Cryptographic protocols and secure computation › proof systems › zero-knowledge proofs › non-interactive zero-knowledge proofs
zk-SNARK |
2.3 | 3 | 2026 | Special Soundness and Binding Properties: A Framework for Tightly Secure zk-SNARKs · EUROCRYPT (7) 2026 Constant-Size zk-SNARKs in ROM from Falsifiable Assumptions · EUROCRYPT (6) 2024 Counting Vampires: From Univariate Sumcheck to Updatable ZK-SNARK · ASIACRYPT (2) 2022 |
Cryptographic protocols and secure computation › proof systems › zero-knowledge proofs
succinct arguments |
0.9 | 1 | 2025 | On Knowledge-Soundness of Plonk in ROM from Falsifiable Assumptions · CRYPTO (7) 2025 |
Cryptographic protocols and secure computation › proof systems
constant-size proofs |
0.8 | 1 | 2024 | Constant-Size zk-SNARKs in ROM from Falsifiable Assumptions · EUROCRYPT (6) 2024 |
Cryptographic protocols and secure computation › proof systems › zero-knowledge proofs
non-interactive zero-knowledge proofs |
0.8 | 1 | 2024 | Constant-Size zk-SNARKs in ROM from Falsifiable Assumptions · EUROCRYPT (6) 2024 |
Cryptographic protocols and secure computation › proof systems › zero-knowledge proofs › succinct arguments
succinct non-interactive arguments |
0.7 | 2 | 2021 | On Subversion-Resistant SNARKs · J. Cryptol. 2021 Snarky Ceremonies · ASIACRYPT (3) 2021 |
Cryptographic protocols and secure computation › proof systems
sumcheck protocol |
0.6 | 1 | 2022 | Counting Vampires: From Univariate Sumcheck to Updatable ZK-SNARK · ASIACRYPT (2) 2022 |
Cryptographic primitives and cryptanalysis
one-way functions |
0.5 | 1 | 2021 | Verifiably-Extractable OWFs and Their Applications to Subversion Zero-Knowledge · ASIACRYPT (4) 2021 |
Cryptographic protocols and secure computation
subversion resistance |
0.5 | 1 | 2021 | On Subversion-Resistant SNARKs · J. Cryptol. 2021 |
Cryptographic primitives and cryptanalysis
pairing-based cryptography |
0.3 | 1 | 2017 | An Efficient Pairing-Based Shuffle Argument · ASIACRYPT (2) 2017 |
Cryptographic protocols and secure computation › proof systems › zero-knowledge proofs
shuffle argument |
0.3 | 1 | 2017 | An Efficient Pairing-Based Shuffle Argument · ASIACRYPT (2) 2017 |
Methods — techniques the papers use, named apart from their topics
random oracle model · 1.6falsifiable assumptions · 1.6pairing-based cryptography · 0.3
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | Special Soundness and Binding Properties: A Framework for Tightly Secure zk-SNARKs
Erki Külaots, Helger Lipmaa, Roberto Parisella, Janno Siim |
EUROCRYPT (7) | 4 |
| 2025 | On Knowledge-Soundness of Plonk in ROM from Falsifiable Assumptions
Helger Lipmaa, Roberto Parisella, Janno Siim |
CRYPTO (7) | 3 |
| 2024 | Constant-Size zk-SNARKs in ROM from Falsifiable Assumptions
Helger Lipmaa, Roberto Parisella, Janno Siim |
EUROCRYPT (6) | 3 |
| 2023 | Algebraic Group Model with Oblivious Sampling
Helger Lipmaa, Roberto Parisella, Janno Siim |
TCC (4) | 3 |
| 2022 | Counting Vampires: From Univariate Sumcheck to Updatable ZK-SNARK
Helger Lipmaa, Janno Siim, Michal Zajac 0001 |
ASIACRYPT (2) | 2 |
| 2021 | Verifiably-Extractable OWFs and Their Applications to Subversion Zero-Knowledge
Prastudy Fauzi, Helger Lipmaa, Janno Siim, Michal Zajac 0001, Arne Tobias Ødegaard |
ASIACRYPT (4) | 3 |
| 2021 | Snarky Ceremonies
Markulf Kohlweiss, Mary Maller, Janno Siim, Mikhail Volkhov |
ASIACRYPT (3) | 3 |
| 2021 | On Subversion-Resistant SNARKs
Behzad Abdolmaleki, Helger Lipmaa, Janno Siim, Michal Zajac 0001 |
J. Cryptol. | 3 |
| 2020 | A Non-interactive Shuffle Argument with Low Trust Assumptions
Antonis Aggelakis, Prastudy Fauzi, Georgios Korfiatis, Panagiotis Louridas, Foteinos Mergoupis-Anagnou, Janno Siim, Michal Zajac 0001 |
CT-RSA | 6 |
| 2019 | DL-Extractable UC-Commitment Schemes
Behzad Abdolmaleki, Karim Baghery, Helger Lipmaa, Janno Siim, Michal Zajac 0001 |
ACNS | 4 |
| 2017 | An Efficient Pairing-Based Shuffle Argument
Prastudy Fauzi, Helger Lipmaa, Janno Siim, Michal Zajac 0001 |
ASIACRYPT (2) | 3 |