default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJanno Siim
Person information
- affiliation: Simula UiB, Bergen, Norway
- affiliation: University of Tartu, Tartu, Estonia
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c15]Helger Lipmaa
, Roberto Parisella, Janno Siim:
Constant-Size zk-SNARKs in ROM from Falsifiable Assumptions. EUROCRYPT (6) 2024: 34-64- [c14]Behzad Abdolmaleki, Prastudy Fauzi, Toomas Krips, Janno Siim:
Shuffle Arguments Based on Subset-Checking. SCN (1) 2024: 345-366 - [i17]Helger Lipmaa, Roberto Parisella, Janno Siim:
Constant-Size zk-SNARKs in ROM from Falsifiable Assumptions. IACR Cryptol. ePrint Arch. 2024: 173 (2024) - [i16]Helger Lipmaa, Roberto Parisella, Janno Siim:
On Knowledge-Soundness of Plonk in ROM from Falsifiable Assumptions. IACR Cryptol. ePrint Arch. 2024: 994 (2024) - [i15]Behzad Abdolmaleki, Prastudy Fauzi, Toomas Krips, Janno Siim:
Shuffle Arguments Based on Subset-Checking. IACR Cryptol. ePrint Arch. 2024: 1056 (2024) - 2023
- [c13]Matteo Campanelli, Chaya Ganesh, Hamidreza Khoshakhlagh, Janno Siim:
Impossibilities in Succinct Arguments: Black-Box Extraction and More. AFRICACRYPT 2023: 465-489 - [c12]Helger Lipmaa, Roberto Parisella, Janno Siim:
Algebraic Group Model with Oblivious Sampling. TCC (4) 2023: 363-392 - [i14]Helger Lipmaa, Roberto Parisella, Janno Siim:
Algebraic Group Model with Oblivious Sampling. IACR Cryptol. ePrint Arch. 2023: 1504 (2023) - 2022
- [c11]Helger Lipmaa, Janno Siim, Michal Zajac:
Counting Vampires: From Univariate Sumcheck to Updatable ZK-SNARK. ASIACRYPT (2) 2022: 249-278 - [i13]Helger Lipmaa, Janno Siim, Michal Zajac:
Counting Vampires: From Univariate Sumcheck to Updatable ZK-SNARK. IACR Cryptol. ePrint Arch. 2022: 406 (2022) - [i12]Matteo Campanelli, Chaya Ganesh, Hamidreza Khoshakhlagh, Janno Siim:
Impossibilities in Succinct Arguments: Black-box Extraction and More. IACR Cryptol. ePrint Arch. 2022: 638 (2022) - 2021
- [j1]Behzad Abdolmaleki, Helger Lipmaa, Janno Siim, Michal Zajac:
On Subversion-Resistant SNARKs. J. Cryptol. 34(3): 17 (2021) - [c10]Markulf Kohlweiss, Mary Maller, Janno Siim, Mikhail Volkhov:
Snarky Ceremonies. ASIACRYPT (3) 2021: 98-127 - [c9]Prastudy Fauzi, Helger Lipmaa, Janno Siim, Michal Zajac, Arne Tobias Ødegaard:
Verifiably-Extractable OWFs and Their Applications to Subversion Zero-Knowledge. ASIACRYPT (4) 2021: 618-649 - [c8]Prastudy Fauzi, Helger Lipmaa, Zaira Pindado, Janno Siim:
Somewhere Statistically Binding Commitment Schemes with Applications. Financial Cryptography (1) 2021: 436-456 - [c7]Karim Baghery, Markulf Kohlweiss, Janno Siim, Mikhail Volkhov:
Another Look at Extraction and Randomization of Groth's zk-SNARK. Financial Cryptography (1) 2021: 457-475 - [i11]Markulf Kohlweiss, Mary Maller, Janno Siim, Mikhail Volkhov:
Snarky Ceremonies. IACR Cryptol. ePrint Arch. 2021: 219 (2021) - [i10]Prastudy Fauzi, Helger Lipmaa, Janno Siim, Michal Zajac, Arne Tobias Ødegaard:
Verifiably-Extractable OWFs and Their Applications to Subversion Zero-Knowledge. IACR Cryptol. ePrint Arch. 2021: 1264 (2021) - 2020
- [c6]Antonis Aggelakis, Prastudy Fauzi, Georgios Korfiatis, Panos Louridas, Foteinos Mergoupis-Anagnou, Janno Siim, Michal Zajac:
A Non-interactive Shuffle Argument with Low Trust Assumptions. CT-RSA 2020: 667-692 - [c5]Behzad Abdolmaleki, Helger Lipmaa, Janno Siim, Michal Zajac:
On QA-NIZK in the BPK Model. Public Key Cryptography (1) 2020: 590-620 - [i9]Prastudy Fauzi, Helger Lipmaa, Zaira Pindado, Janno Siim:
Somewhere Statistically Binding Commitment Schemes with Applications. IACR Cryptol. ePrint Arch. 2020: 652 (2020) - [i8]Behzad Abdolmaleki, Helger Lipmaa, Janno Siim, Michal Zajac:
On Subversion-Resistant SNARKs. IACR Cryptol. ePrint Arch. 2020: 668 (2020)
2010 – 2019
- 2019
- [c4]Behzad Abdolmaleki, Karim Baghery, Helger Lipmaa, Janno Siim, Michal Zajac:
DL-Extractable UC-Commitment Schemes. ACNS 2019: 385-405 - [c3]Behzad Abdolmaleki, Karim Baghery, Helger Lipmaa, Janno Siim, Michal Zajac:
UC-Secure CRS Generation for SNARKs. AFRICACRYPT 2019: 99-117 - [i7]Behzad Abdolmaleki, Karim Baghery, Helger Lipmaa, Janno Siim, Michal Zajac:
DL-Extractable UC-Commitment Schemes. IACR Cryptol. ePrint Arch. 2019: 201 (2019) - [i6]Behzad Abdolmaleki, Karim Baghery, Helger Lipmaa, Janno Siim, Michal Zajac:
UC-Secure CRS Generation for SNARKs. IACR Cryptol. ePrint Arch. 2019: 471 (2019) - [i5]Antonis Aggelakis, Prastudy Fauzi, Georgios Korfiatis, Panos Louridas, Foteinos Mergoupis-Anagnou, Janno Siim, Michal Zajac:
A Non-Interactive Shuffle Argument With Low Trust Assumptions. IACR Cryptol. ePrint Arch. 2019: 1420 (2019) - 2018
- [c2]Aggelos Kiayias, Annabell Kuldmaa, Helger Lipmaa, Janno Siim, Thomas Zacharias:
On the Security Properties of e-Voting Bulletin Boards. SCN 2018: 505-523 - [i4]Aggelos Kiayias, Annabell Kuldmaa, Helger Lipmaa, Janno Siim, Thomas Zacharias:
On the Security Properties of e-Voting Bulletin Boards. IACR Cryptol. ePrint Arch. 2018: 567 (2018) - [i3]Sven Heiberg, Ivo Kubjas, Janno Siim, Jan Willemson:
On Trade-offs of Applying Block Chains for Electronic Voting Bulletin Boards. IACR Cryptol. ePrint Arch. 2018: 685 (2018) - [i2]Behzad Abdolmaleki, Helger Lipmaa, Janno Siim, Michal Zajac:
On QA-NIZK in the BPK Model. IACR Cryptol. ePrint Arch. 2018: 877 (2018) - 2017
- [c1]Prastudy Fauzi, Helger Lipmaa, Janno Siim, Michal Zajac:
An Efficient Pairing-Based Shuffle Argument. ASIACRYPT (2) 2017: 97-127 - [i1]Prastudy Fauzi, Helger Lipmaa, Janno Siim, Michal Zajac:
An Efficient Pairing-Based Shuffle Argument. IACR Cryptol. ePrint Arch. 2017: 894 (2017)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-04 20:59 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
