Janno Siim

dblp:209/1796 · DBLP profile ↗
← Back
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
YearPublicationVenuePosition
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-RSA6
2019 DL-Extractable UC-Commitment Schemes
Behzad Abdolmaleki, Karim Baghery, Helger Lipmaa, Janno Siim, Michal Zajac 0001
ACNS4
2017 An Efficient Pairing-Based Shuffle Argument
Prastudy Fauzi, Helger Lipmaa, Janno Siim, Michal Zajac 0001
ASIACRYPT (2)3