Get started
Author

Michał Zając

Observed names: Michal Zajac, Michal Zaja̧c, Zajac, Michal, Zając, Michał
ORCID: 0000-0002-6692-2011
Observed ORCID: 0000-0002-6692-2011
OpenAlex ID: A5086177010
A Subversion-Resistant SNARK
2017 · Behzad Abdolmaleki, Karim Baghery, et al. · Lecture notes in computer science · 64
ZETH: On Integrating Zerocash on Ethereum
2019 · Rondelet, Antoine, Zajac, Michal · arXiv (Cornell University) · 43
PDF
An Efficient Pairing-Based Shuffle Argument
2017 · Prastudy Fauzi, Helger Lipmaa, et al. · Lecture notes in computer science · 32
What Makes Fiat–Shamir zkSNARKs (Updatable SRS) Simulation Extractable?
2022 · Chaya Ganesh, Hamidreza Khoshakhlagh, et al. · Lecture notes in computer science · 29
Counting Vampires: From Univariate Sumcheck to Updatable ZK-SNARK
2022 · Helger Lipmaa, Janno Siim, et al. · Lecture notes in computer science · 20
On QA-NIZK in the BPK Model
2020 · Behzad Abdolmaleki, Helger Lipmaa, et al. · Lecture notes in computer science · 19
Aplikacje książkowe dla dzieci młodszych: między książką a grą komputerową
2013 · Michał Zając · Ars Educandi · 19
PDF
From Polynomial IOP and Commitments to Non-malleable zkSNARKs
2023 · Antonio Faonio, Dario Fiore, et al. · Lecture notes in computer science · 18
PDF
Fiat-Shamir Security of FRI and Related SNARKs
2023 · Alexander R. Block, Albert Garreta, et al. · Lecture notes in computer science · 16
PDF
A Shuffle Argument Secure in the Generic Model
2016 · Prastudy Fauzi, Helger Lipmaa, et al. · Lecture notes in computer science · 16
On Subversion-Resistant SNARKs
2021 · Behzad Abdolmaleki, Helger Lipmaa, et al. · Journal of Cryptology · 15
UC-Secure CRS Generation for SNARKs
2019 · Behzad Abdolmaleki, Karim Baghery, et al. · Lecture notes in computer science · 15
DL-Extractable UC-Commitment Schemes
2019 · Behzad Abdolmaleki, Karim Baghery, et al. · Lecture notes in computer science · 8
One-Time Programs with Limited Memory
2014 · Konrad Durnoga, Stefan Dziembowski, et al. · Lecture notes in computer science · 8
On Soundness Notions for Interactive Oracle Proofs
2024 · Alexander R. Block, Albert Garreta, et al. · Journal of Cryptology · 4
A Non-interactive Shuffle Argument with Low Trust Assumptions
2020 · Antonis Aggelakis, Prastudy Fauzi, et al. · Lecture notes in computer science · 3
Social issues in children picturebook apps and their reception by the parents of children in early education
2016 · Małgorzata Cackowska, Michał Zając · Problemy Wczesnej Edukacji · 3
Verifiably-Extractable OWFs and Their Applications to Subversion Zero-Knowledge
2021 · Prastudy Fauzi, Helger Lipmaa, et al. · Lecture notes in computer science · 2
Darmowa książka dla nowo narodzonego dziecka: jeden pomysł – wiele realizacji
2015 · Michał Zając · Wydawnictwo Uniwersytetu Łódzkiego, Wydawnictwo Stowarzyszenia Bibliotekarzy Polskich eBooks · 2
PDF
Bounded-Retrieval Model with Keys Derived from Private Data
2017 · Konrad Durnoga, Stefan Dziembowski, et al. · Lecture notes in computer science · 1
A Non-Interactive Shuffle Argument With Low Trust Assumptions.
2019 · Antonis Aggelakis, Prastudy Fauzi, et al. · IACR Cryptology ePrint Archive
Interteksty malarskie w wybranych książkach obrazkowych Anthony’ego Browne
2018 · Michał Zając · Bibliotekarz Podlaski Ogólnopolskie Naukowe Pismo Bibliotekoznawcze i Bibliologiczne
PDF
Effective cryptographic protocols on devices with limited computational power and memory
2018 · Michał Zając
Leakage-resilient Cryptography with key derived from sensitive data
2015 · Durnoga, Konrad, Kazana, Tomasz, et al. · arXiv (Cornell University)
PDF
One Time Programs with Limited Memory.
2015 · Konrad Durnoga, Stefan Dziembowski, et al.
Works count: 26
Citation count: 337
H-index: 12
I10-index: 12
Year
Topic
Type