Demo Data from SIGIR 2026 / reviewers in the wild / expert
Michal Zajac 0001
dblp:02/6977
· DBLP profile ↗
13ranked-venue papers
0as first author
6since 2021 · last 2025
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Security and privacy · 13 · 6 since 2021Theory of computation · 1 · 1 since 2021
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Network and information security
8 papers |
Cryptographic protocols and secure computation · 88% Cryptographic primitives and cryptanalysis · 12% |
Topics — the 13 heaviest of 13, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Cryptographic protocols and secure computation › proof systems
zero-knowledge proofs |
1.6 | 4 | 2022 | Counting Vampires: From Univariate Sumcheck to Updatable ZK-SNARK · ASIACRYPT (2) 2022 Verifiably-Extractable OWFs and Their Applications to Subversion Zero-Knowledge · ASIACRYPT (4) 2021 An Efficient Pairing-Based Shuffle Argument · ASIACRYPT (2) 2017 |
Cryptographic protocols and secure computation › proof systems › zero-knowledge proofs › succinct arguments
succinct non-interactive arguments |
1.2 | 2 | 2023 | Fiat-Shamir Security of FRI and Related SNARKs · ASIACRYPT (2) 2023 On Subversion-Resistant SNARKs · J. Cryptol. 2021 |
Cryptographic protocols and secure computation › proof systems
interactive oracle proofs |
1.1 | 2 | 2025 | On Soundness Notions for Interactive Oracle Proofs · J. Cryptol. 2025 Fiat-Shamir Security of FRI and Related SNARKs · ASIACRYPT (2) 2023 |
Cryptographic protocols and secure computation › proof systems
soundness |
0.9 | 1 | 2025 | On Soundness Notions for Interactive Oracle Proofs · J. Cryptol. 2025 |
Cryptographic protocols and secure computation
fiat-shamir transform |
0.7 | 1 | 2023 | Fiat-Shamir Security of FRI and Related SNARKs · ASIACRYPT (2) 2023 |
Cryptographic protocols and secure computation
subversion resistance |
0.6 | 2 | 2021 | On Subversion-Resistant SNARKs · J. Cryptol. 2021 A Subversion-Resistant SNARK · ASIACRYPT (3) 2017 |
Cryptographic protocols and secure computation › proof systems
sumcheck protocol |
0.6 | 1 | 2022 | Counting Vampires: From Univariate Sumcheck to Updatable ZK-SNARK · ASIACRYPT (2) 2022 |
Cryptographic protocols and secure computation › proof systems › zero-knowledge proofs › non-interactive zero-knowledge proofs
zk-SNARK |
0.6 | 1 | 2022 | Counting Vampires: From Univariate Sumcheck to Updatable ZK-SNARK · ASIACRYPT (2) 2022 |
Cryptographic protocols and secure computation › proof systems › zero-knowledge proofs
shuffle argument |
0.5 | 2 | 2017 | An Efficient Pairing-Based Shuffle Argument · ASIACRYPT (2) 2017 A Shuffle Argument Secure in the Generic Model · ASIACRYPT (2) 2016 |
Cryptographic primitives and cryptanalysis
one-way functions |
0.5 | 1 | 2021 | Verifiably-Extractable OWFs and Their Applications to Subversion Zero-Knowledge · ASIACRYPT (4) 2021 |
Cryptographic primitives and cryptanalysis
pairing-based cryptography |
0.3 | 1 | 2017 | An Efficient Pairing-Based Shuffle Argument · ASIACRYPT (2) 2017 |
Cryptographic protocols and secure computation › proof systems
succinct non-interactive arguments of knowledge |
0.3 | 1 | 2017 | A Subversion-Resistant SNARK · ASIACRYPT (3) 2017 |
Cryptographic primitives and cryptanalysis › cryptographic foundations › cryptographic models
generic group model |
0.2 | 1 | 2016 | A Shuffle Argument Secure in the Generic Model · ASIACRYPT (2) 2016 |
Methods — techniques the papers use, named apart from their topics
pairing-based cryptography · 0.3
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | On Soundness Notions for Interactive Oracle Proofs
Alexander R. Block, Albert Garreta, Pratyush Ranjan Tiwari, Michal Zajac 0001 |
J. Cryptol. | 4 |
| 2023 | Fiat-Shamir Security of FRI and Related SNARKs
Alexander R. Block, Albert Garreta, Jonathan Katz, Justin Thaler, Pratyush Ranjan Tiwari, Michal Zajac 0001 |
ASIACRYPT (2) | 6 |
| 2023 | From Polynomial IOP and Commitments to Non-malleable zkSNARKs
Antonio Faonio, Dario Fiore 0001, Markulf Kohlweiss, Luigi Russo 0001, Michal Zajac 0001 |
TCC (3) | 5 |
| 2022 | Counting Vampires: From Univariate Sumcheck to Updatable ZK-SNARK
Helger Lipmaa, Janno Siim, Michal Zajac 0001 |
ASIACRYPT (2) | 3 |
| 2021 | Verifiably-Extractable OWFs and Their Applications to Subversion Zero-Knowledge
Prastudy Fauzi, Helger Lipmaa, Janno Siim, Michal Zajac 0001, Arne Tobias Ødegaard |
ASIACRYPT (4) | 4 |
| 2021 | On Subversion-Resistant SNARKs
Behzad Abdolmaleki, Helger Lipmaa, Janno Siim, Michal Zajac 0001 |
J. Cryptol. | 4 |
| 2020 | A Non-interactive Shuffle Argument with Low Trust Assumptions
Antonis Aggelakis, Prastudy Fauzi, Georgios Korfiatis, Panagiotis Louridas, Foteinos Mergoupis-Anagnou, Janno Siim, Michal Zajac 0001 |
CT-RSA | 7 |
| 2019 | DL-Extractable UC-Commitment Schemes
Behzad Abdolmaleki, Karim Baghery, Helger Lipmaa, Janno Siim, Michal Zajac 0001 |
ACNS | 5 |
| 2017 | A Subversion-Resistant SNARK
Behzad Abdolmaleki, Karim Baghery, Helger Lipmaa, Michal Zajac 0001 |
ASIACRYPT (3) | 4 |
| 2017 | An Efficient Pairing-Based Shuffle Argument
Prastudy Fauzi, Helger Lipmaa, Janno Siim, Michal Zajac 0001 |
ASIACRYPT (2) | 4 |
| 2016 | A Shuffle Argument Secure in the Generic Model
Prastudy Fauzi, Helger Lipmaa, Michal Zajac 0001 |
ASIACRYPT (2) | 3 |
| 2016 | Bounded-Retrieval Model with Keys Derived from Private Data
Konrad Durnoga, Stefan Dziembowski, Tomasz Kazana, Michal Zajac 0001, Maciej Zdanowicz |
Inscrypt | 4 |
| 2013 | One-Time Programs with Limited Memory
Konrad Durnoga, Stefan Dziembowski, Tomasz Kazana, Michal Zajac 0001 |
Inscrypt | 4 |