Michal Zajac

Affiliations:
  • Nethermind, UK
  • University of Tartu, Estonia (former)
  • University of Warsaw, Poland (former, PhD)


According to our database1, Michal Zajac authored at least 21 papers between 2013 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
On amortization techniques for FRI-based SNARKs.
IACR Cryptol. ePrint Arch., 2024

2023
COMMON: Order Book with Privacy.
IACR Cryptol. ePrint Arch., 2023

On Soundness Notions for Interactive Oracle Proofs.
IACR Cryptol. ePrint Arch., 2023

From Polynomial IOP and Commitments to Non-malleable zkSNARKs.
Proceedings of the Theory of Cryptography - 21st International Conference, 2023

Fiat-Shamir Security of FRI and Related SNARKs.
Proceedings of the Advances in Cryptology - ASIACRYPT 2023, 2023

2022
What Makes Fiat-Shamir zkSNARKs (Updatable SRS) Simulation Extractable?
Proceedings of the Security and Cryptography for Networks - 13th International Conference, 2022

Counting Vampires: From Univariate Sumcheck to Updatable ZK-SNARK.
Proceedings of the Advances in Cryptology - ASIACRYPT 2022, 2022

2021
On Simulation-Extractability of Universal zkSNARKs.
IACR Cryptol. ePrint Arch., 2021

Verifiably-Extractable OWFs and Their Applications to Subversion Zero-Knowledge.
Proceedings of the Advances in Cryptology - ASIACRYPT 2021, 2021

2020
On Subversion-Resistant SNARKs.
IACR Cryptol. ePrint Arch., 2020

On QA-NIZK in the BPK Model.
Proceedings of the Public-Key Cryptography - PKC 2020, 2020

A Non-interactive Shuffle Argument with Low Trust Assumptions.
Proceedings of the Topics in Cryptology - CT-RSA 2020, 2020

2019
ZETH: On Integrating Zerocash on Ethereum.
CoRR, 2019

UC-Secure CRS Generation for SNARKs.
Proceedings of the Progress in Cryptology - AFRICACRYPT 2019, 2019

DL-Extractable UC-Commitment Schemes.
Proceedings of the Applied Cryptography and Network Security, 2019

2017
An Efficient Pairing-Based Shuffle Argument.
Proceedings of the Advances in Cryptology - ASIACRYPT 2017, 2017

A Subversion-Resistant SNARK.
Proceedings of the Advances in Cryptology - ASIACRYPT 2017, 2017

2016
Bounded-Retrieval Model with Keys Derived from Private Data.
Proceedings of the Information Security and Cryptology - 12th International Conference, 2016

A Shuffle Argument Secure in the Generic Model.
Proceedings of the Advances in Cryptology - ASIACRYPT 2016, 2016

2015
Leakage-Resilient Cryptography with Key Derived from Sensitive Data.
IACR Cryptol. ePrint Arch., 2015

2013
One-Time Programs with Limited Memory.
Proceedings of the Information Security and Cryptology - 9th International Conference, 2013


  Loading...