Janno Siim

Orcid: 0000-0001-5824-7215

Affiliations:
  • Simula UiB, Bergen, Norway
  • University of Tartu, Tartu, Estonia


According to our database1, Janno Siim authored at least 19 papers between 2017 and 2025.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
Revisiting Discrete Logarithm Reductions.
IACR Commun. Cryptol., 2025

On Knowledge-Soundness of Plonk in ROM from Falsifiable Assumptions.
Proceedings of the Advances in Cryptology - CRYPTO 2025, 2025

2024
Shuffle Arguments Based on Subset-Checking.
Proceedings of the Security and Cryptography for Networks - 14th International Conference, 2024

Constant-Size zk-SNARKs in ROM from Falsifiable Assumptions.
Proceedings of the Advances in Cryptology - EUROCRYPT 2024, 2024

2023
Algebraic Group Model with Oblivious Sampling.
Proceedings of the Theory of Cryptography - 21st International Conference, 2023

Impossibilities in Succinct Arguments: Black-Box Extraction and More.
Proceedings of the Progress in Cryptology - AFRICACRYPT 2023, 2023

2022
Counting Vampires: From Univariate Sumcheck to Updatable ZK-SNARK.
Proceedings of the Advances in Cryptology - ASIACRYPT 2022, 2022

2021
Somewhere Statistically Binding Commitment Schemes with Applications.
Proceedings of the Financial Cryptography and Data Security, 2021

Another Look at Extraction and Randomization of Groth's zk-SNARK.
Proceedings of the Financial Cryptography and Data Security, 2021

Snarky Ceremonies.
Proceedings of the Advances in Cryptology - ASIACRYPT 2021, 2021

Verifiably-Extractable OWFs and Their Applications to Subversion Zero-Knowledge.
Proceedings of the Advances in Cryptology - ASIACRYPT 2021, 2021

2020
On Subversion-Resistant SNARKs.
IACR Cryptol. ePrint Arch., 2020

On QA-NIZK in the BPK Model.
Proceedings of the Public-Key Cryptography - PKC 2020, 2020

A Non-interactive Shuffle Argument with Low Trust Assumptions.
Proceedings of the Topics in Cryptology - CT-RSA 2020, 2020

2019
UC-Secure CRS Generation for SNARKs.
Proceedings of the Progress in Cryptology - AFRICACRYPT 2019, 2019

DL-Extractable UC-Commitment Schemes.
Proceedings of the Applied Cryptography and Network Security, 2019

2018
On Trade-offs of Applying Block Chains for Electronic Voting Bulletin Boards.
IACR Cryptol. ePrint Arch., 2018

On the Security Properties of e-Voting Bulletin Boards.
Proceedings of the Security and Cryptography for Networks - 11th International Conference, 2018

2017
An Efficient Pairing-Based Shuffle Argument.
Proceedings of the Advances in Cryptology - ASIACRYPT 2017, 2017


  Loading...