One Time Programs with Limited Memory. - Konrad Durnoga; Stefan Dziembowski; Tomasz Kazana; Michal Zajac 001 (IACR Cryptol. ePrint Arch., 2015)

Leakage-Resilient Cryptography with Key Derived from Sensitive Data. - Konrad Durnoga; Tomasz Kazana; Michal Zajac 001; Maciej Zdanowicz (IACR Cryptol. ePrint Arch., 2015)

Bounded-Retrieval Model with Keys Derived from Private Data. - Konrad Durnoga; Stefan Dziembowski; Tomasz Kazana; Michal Zajac 001; Maciej Zdanowicz (Inscrypt, 2016)

A Shuffle Argument Secure in the Generic Model. - Prastudy Fauzi; Helger Lipmaa; Michal Zajac 001 (IACR Cryptol. ePrint Arch., 2016)

A Subversion-Resistant SNARK. - Behzad Abdolmaleki; Karim Baghery; Helger Lipmaa; Michal Zajac 001 (IACR Cryptol. ePrint Arch., 2017)

An Efficient Pairing-Based Shuffle Argument. - Prastudy Fauzi; Helger Lipmaa; Janno Siim; Michal Zajac 001 (IACR Cryptol. ePrint Arch., 2017)

On QA-NIZK in the BPK Model. - Behzad Abdolmaleki; Helger Lipmaa; Janno Siim; Michal Zajac 001 (IACR Cryptol. ePrint Arch., 2018)

ZETH: On Integrating Zerocash on Ethereum. - Antoine Rondelet; Michal Zajac 001 (CoRR, 2019)

DL-Extractable UC-Commitment Schemes. - Behzad Abdolmaleki; Karim Baghery; Helger Lipmaa; Janno Siim; Michal Zajac 001 (IACR Cryptol. ePrint Arch., 2019)

UC-Secure CRS Generation for SNARKs. - Behzad Abdolmaleki; Karim Baghery; Helger Lipmaa; Janno Siim; Michal Zajac 001 (IACR Cryptol. ePrint Arch., 2019)

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

Verifiably-Extractable OWFs and Their Applications to Subversion Zero-Knowledge. - Prastudy Fauzi; Helger Lipmaa; Janno Siim; Michal Zajac 001; Arne Tobias Ødegaard (IACR Cryptol. ePrint Arch., 2021)

On Simulation-Extractability of Universal zkSNARKs. - Markulf Kohlweiss; Michal Zajac 001 (IACR Cryptol. ePrint Arch., 2021)

On Subversion-Resistant SNARKs. - Behzad Abdolmaleki; Helger Lipmaa; Janno Siim; Michal Zajac 001 (J. Cryptol., 2021)

What Makes Fiat-Shamir zkSNARKs (Updatable SRS) Simulation Extractable? - Chaya Ganesh; Hamidreza Khoshakhlagh; Markulf Kohlweiss; Anca Nitulescu; Michal Zajac 001 (SCN, 2022)

Counting Vampires: From Univariate Sumcheck to Updatable ZK-SNARK. - Helger Lipmaa; Janno Siim; Michal Zajac 001 (IACR Cryptol. ePrint Arch., 2022)

Fiat-Shamir Security of FRI and Related SNARKs. - Alexander R. Block; Albert Garreta; Jonathan Katz; Justin Thaler; Pratyush Ranjan Tiwari; Michal Zajac 001 (IACR Cryptol. ePrint Arch., 2023)

From Polynomial IOP and Commitments to Non-malleable zkSNARKs. - Antonio Faonio; Dario Fiore 001; Markulf Kohlweiss; Luigi Russo 001; Michal Zajac 001 (IACR Cryptol. ePrint Arch., 2023)

COMMON: Order Book with Privacy. - Albert Garreta; Adam Gagol; Aikaterini-Panagiota Stouka; Damian Straszak; Michal Zajac 001 (IACR Cryptol. ePrint Arch., 2023)

On amortization techniques for FRI-based SNARKs. - Albert Garreta; Hayk Hovhanissyan; Aram Jivanyan; Ignacio Manzur; Isaac Villalobos; Michal Zajac 001 (IACR Cryptol. ePrint Arch., 2024)

On Soundness Notions for Interactive Oracle Proofs. - Alexander R. Block; Albert Garreta; Pratyush Ranjan Tiwari; Michal Zajac 001 (J. Cryptol., 2025)