Skip To Main Content
Janno Siim on Muck Rack

Janno Siim

Is this you? As a journalist, you can create a free Muck Rack account to customize your profile, list your contact preferences, and upload a portfolio of your best work. Claim your profile
Back to Janno Siim’s profile

Articles by Janno Siim

Constant-Size zk-SNARKs in ROM from Falsifiable Assumptions

|
By Helger Lipmaa, Roberto Parisella, Janno Siim, Simula UiB
| eprint.iacr.org
Paper 2024/173 , University of Tartu , Simula UiB , Simula UiB We prove that the seminal KZG polynomial commitment scheme (PCS) is black-box extractable under a simple falsifiable assumption ARSDH. To create an interactive argument, we construct a compiler that combines a black-box extractable non-interactive PCS and a polynomial IOP (PIOP). The compiler incurs a minor cost per every committed polynomial.
Open in Who Shared Issue with article?

Algebraic Group Model with Oblivious Sampling

|
By Janno Siim
| eprint.iacr.org
Open in Who Shared Issue with article?

Somewhere Statistically Binding Commitment Schemes with Applications

|
By Helger Lipmaa, Janno Siim, Prastudy Fauzi, Zaira Pindado
| eprint.iacr.org
Paper 2020/652 Somewhere Statistically Binding Commitment Schemes with Applications We define a new primitive that we call a somewhere statistically binding (SSB) commitment scheme, which is a generalization of dual-mode commitments but has similarities with SSB hash functions (Hubacek and Wichs, ITCS 2015) without local opening. In (existing) SSB hash functions, one can compute a hash of a vector v that is statistically binding in one coordinate of v.
Open in Who Shared Issue with article?

Impossibilities in Succinct Arguments: Black-box Extraction and More

|
By Matteo Campanelli, Chaya Ganesh, Hamidreza Khoshakhlagh, Janno Siim
| eprint.iacr.org
Paper 2022/638 Impossibilities in Succinct Arguments: Black-box Extraction and More Abstract The celebrated result by Gentry and Wichs established a theoretical barrier for succinct non-interactive arguments (SNARGs), showing that for (expressive enough) hard-on-average languages we must assume non-falsifiable assumptions. We further investigate those barriers by showing new negative and positive results related to extractability and to the preprocessing model. 1.
Open in Who Shared Issue with article?
Show More