Janno Siim
I am currently a postdoctoral researcher in cryptography at Simula UiB in Norway. My main research interests are:
- Zero-knowledge proofs.
- SNARKs.
- The design of advanced cryptographic protocols.
- Provable security (especially in idealized security models).
I obtained a PhD at the University of Tartu under the supervision of Helger Lipmaa. Previously I was also a postdoctoral researcher at the University of Edinburgh under the supervision of Markulf Kohlweiss.
Send me an email to get in touch (jannosiim@gmail.com). I am always interested in discussing new research.
Contact: jannosiim@gmail.com
DBLP, Google Scholar, ETIS, Twitter (𝕏), CV
Last updated: 03.07.2024
DBLP, Google Scholar, ETIS, Twitter (𝕏), CV
Last updated: 03.07.2024
Publications
-
On Knowledge-Soundness of Plonk in ROM from Falsifiable Assumptions. (EPRINT 2024)
Helger Lipmaa, Roberto Parisella, and Janno Siim Full -
Shuffle Arguments Based on Subset-Checking. (SCN 2024)
Behzad Abdolmaleki, Prastudy Fauzi, Toomas Krips, and Janno Siim Full -
Constant-Size zk-SNARKs in ROM from Falsifiable Assumptions. (EUROCRYPT 2024)
Helger Lipmaa, Roberto Parisella, and Janno Siim Full -
Algebraic Group Model with Oblivious Sampling. (TCC 2023)
Helger Lipmaa, Roberto Parisella, and Janno Siim Full -
Impossibilities in Succinct Arguments: Black-box Extraction and More. (AFRICACRYPT 2023)
Matteo Campanelli, Chaya Ganesh, Hamidreza Khoshakhlagh, and Janno Siim Full -
Counting Vampires: From Univariate Sumcheck to Updatable ZK-SNARK. (ASIACRYPT 2022)
Helger Lipmaa, Janno Siim, and Michał Zając Full -
On Subversion-Resistant SNARKs. (Journal of Cryptology 2021)
Behzad Abdolmaleki, Helger Lipmaa, Janno Siim, and Michał Zając Full -
Verifiably-extractable OWFs and Their Applications to Subversion Zero-knowledge. (ASIACRYPT 2021)
Prastudy Fauzi, Helger Lipmaa, Janno Siim, Michał Zając, and Arne Tobias Ødegaard Full -
Snarky Ceremonies. (ASIACRYPT 2021)
Markulf Kohlweiss, Mary Maller, Janno Siim, and Mikhail Volkhov Full -
Another Look at Extraction and Randomization of Groth's zk-SNARK. (FC 2021)
Karim Baghery, Markulf Kohlweiss, Janno Siim, and Mikhail Volkhov Full -
Somewhere Statistically Binding Commitment Schemes with Applications. (FC 2021)
Prastudy Fauzi, Helger Lipmaa, Zaira Pindado, and Janno Siim Full -
On QA-NIZK in the BPK Model. (PKC 2020)
Behzad Abdolmaleki, Helger Lipmaa, Janno Siim, and Michal Zajac. Full -
A Non-interactive Shuffle Argument With Low Trust Assumptions. (CT-RSA 2020)
Antonis Aggelakis, Prastudy Fauzi, Georgios Korfatis, Panos Louridas, Foteinos Mergoupis-Anagnou, Janno Siim, and Michal Zajac. Full -
UC-secure CRS generation for SNARKs. (AFRICACRYPT 2019)
Behzad Abdolmaleki, Karim Baghery, Helger Lipmaa, Janno Siim, and Michal Zajac. Full -
DL-extractable UC-commitment Schemes. (ACNS 2019)
Behzad Abdolmaleki, Karim Baghery, Helger Lipmaa, Janno Siim, and Michal Zajac. Full -
On Trade-offs of Applying Block Chains for Electronic Voting Bulletin Boards. (E-VOTE-ID 2018)
Sven Heiberg, Janno Siim, Ivo Kubjas, Jan Willemson. Full -
On the Security Properties of E-voting Bulletin Boards. (SCN 2018)
Aggelos Kiayias, Annabell Kuldmaa, Helger Lipmaa, Janno Siim, and Thomas Zacharias. Full -
An Efficient Pairing-based Shuffle Argument. (ASIACRYPT 2017)
Prastudy Fauzi, Helger Lipmaa, Janno Siim, and Michal Zajac. Full -
Interactive Environment For Exercises In Graph Theory. (EDULEARN 2015)
Rein Prank, Heiki Pärn, Janno Siim. Full
Thesis
- PhD Thesis: Non-Interactive Shuffle Arguments Link
- Master's Thesis: Secure and Efficient Mix-Nets Link
- Bachelor's Thesis: Computerization of Graph Theory Exercises Link
Community Work
- ArcticCrypt 2025 program committee member.
- Eurocrypt 2023 program committee member.
- ACNS 2021 program committee member.
- 4th ZKProof Workshop (2021) - Standardization proposal for SNARK ceremonies (with Markulf Kohlweiss, Mary Maller, and Mikhail Volkhov).