We stand with Ukraine  

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 18 papers between 2017 and 2024.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
On Knowledge-Soundness of Plonk in ROM from Falsifiable Assumptions.
[BibTeX]
[DOI]
Helger Lipmaa
,
Roberto Parisella
,
Janno Siim
IACR Cryptol. ePrint Arch., 2024

Constant-Size zk-SNARKs in ROM from Falsifiable Assumptions.
[BibTeX]
[DOI]
Helger Lipmaa
,
Roberto Parisella
,
Janno Siim
IACR Cryptol. ePrint Arch., 2024

Shuffle Arguments Based on Subset-Checking.
[BibTeX]
[DOI]
Behzad Abdolmaleki
,
Prastudy Fauzi
,
Toomas Krips
,
Janno Siim
IACR Cryptol. ePrint Arch., 2024

2023
Algebraic Group Model with Oblivious Sampling.
[BibTeX]
[DOI]
Helger Lipmaa
,
Roberto Parisella
,
Janno Siim
IACR Cryptol. ePrint Arch., 2023

2022
Counting Vampires: From Univariate Sumcheck to Updatable ZK-SNARK.
[BibTeX]
[DOI]
Helger Lipmaa
,
Janno Siim
,
Michal Zajac
IACR Cryptol. ePrint Arch., 2022

Impossibilities in Succinct Arguments: Black-box Extraction and More.
[BibTeX]
[DOI]
Matteo Campanelli
,
Chaya Ganesh
,
Hamidreza Khoshakhlagh
,
Janno Siim
IACR Cryptol. ePrint Arch., 2022

2021
On Subversion-Resistant SNARKs.
[BibTeX]
[DOI]
Behzad Abdolmaleki
,
Helger Lipmaa
,
Janno Siim
,
Michal Zajac
J. Cryptol., 2021

Snarky Ceremonies.
[BibTeX]
[DOI]
Markulf Kohlweiss
,
Mary Maller
,
Janno Siim
,
Mikhail Volkhov
IACR Cryptol. ePrint Arch., 2021

Verifiably-Extractable OWFs and Their Applications to Subversion Zero-Knowledge.
[BibTeX]
[DOI]
Prastudy Fauzi
,
Helger Lipmaa
,
Janno Siim
,
Michal Zajac
,
Arne Tobias Ødegaard
IACR Cryptol. ePrint Arch., 2021

Another Look at Extraction and Randomization of Groth's zk-SNARK.
[BibTeX]
[DOI]
Karim Baghery
,
Markulf Kohlweiss
,
Janno Siim
,
Mikhail Volkhov
Proceedings of the Financial Cryptography and Data Security, 2021

2020
Somewhere Statistically Binding Commitment Schemes with Applications.
[BibTeX]
[DOI]
Prastudy Fauzi
,
Helger Lipmaa
,
Zaira Pindado
,
Janno Siim
IACR Cryptol. ePrint Arch., 2020

2019
A Non-Interactive Shuffle Argument With Low Trust Assumptions.
[BibTeX]
[DOI]
Antonis Aggelakis
,
Prastudy Fauzi
,
Georgios Korfiatis
,
Panos Louridas
,
Foteinos Mergoupis-Anagnou
,
Janno Siim
,
Michal Zajac
IACR Cryptol. ePrint Arch., 2019

UC-Secure CRS Generation for SNARKs.
[BibTeX]
[DOI]
Behzad Abdolmaleki
,
Karim Baghery
,
Helger Lipmaa
,
Janno Siim
,
Michal Zajac
IACR Cryptol. ePrint Arch., 2019

DL-Extractable UC-Commitment Schemes.
[BibTeX]
[DOI]
Behzad Abdolmaleki
,
Karim Baghery
,
Helger Lipmaa
,
Janno Siim
,
Michal Zajac
IACR Cryptol. ePrint Arch., 2019

2018
On the Security Properties of e-Voting Bulletin Boards.
[BibTeX]
[DOI]
Aggelos Kiayias
,
Annabell Kuldmaa
,
Helger Lipmaa
,
Janno Siim
,
Thomas Zacharias
IACR Cryptol. ePrint Arch., 2018

On Trade-offs of Applying Block Chains for Electronic Voting Bulletin Boards.
[BibTeX]
[DOI]
Sven Heiberg
,
Ivo Kubjas
,
Janno Siim
,
Jan Willemson
IACR Cryptol. ePrint Arch., 2018

On QA-NIZK in the BPK Model.
[BibTeX]
[DOI]
Behzad Abdolmaleki
,
Helger Lipmaa
,
Janno Siim
,
Michal Zajac
IACR Cryptol. ePrint Arch., 2018

2017
An Efficient Pairing-Based Shuffle Argument.
[BibTeX]
[DOI]
Prastudy Fauzi
,
Helger Lipmaa
,
Janno Siim
,
Michal Zajac
IACR Cryptol. ePrint Arch., 2017


  Loading...