Alin Tomescu

To read

This is some of the stuff I plan to read or I have already read.

To read

  1. SADS1$^,$2
  2. RSA accumulators without hashing to prime3
  3. Lasso explanation by Distributed Labs4
  4. All of the MLE PCSs in my RobertoFest slides5$^,$6$^,$7$^,$8$^,$9
  5. Goldreich’s short tutorial on ZK10
  6. Mutator sets11

Already read

  • [Groth16]12, most succinct and fastest to verify zkSNARK for R1CS
  • [BGM17]13, player-replaceable MPC for powers-of-$\tau$-like protocols, including Groth1612

  1. Streaming Authenticated Data Structures, by Papamanthou, Charalampos and Shi, Elaine and Tamassia, Roberto and Yi, Ke, in EUROCRYPT 2013, 2013 ↩

  2. Streaming Authenticated Data Structures: Abstraction and Implementation, by Yi Qian and Yupeng Zhang and Xi Chen and Charalampos Papamanthou, in CCSW’14, 2014, [URL] ↩

  3. RSA-Based Dynamic Accumulator without Hashing into Primes, by Victor Youdom Kemmoe and Anna Lysyanskaya, in Cryptology ePrint Archive, Paper 2024/505, 2024, [URL] ↩

  4. Understanding Lasso: A Novel Lookup Argument Protocol, by Oleg Fomenko and Anton Levochko, in Cryptology {ePrint} Archive, Paper 2025/1169, 2025, [URL] ↩

  5. Dory: Efficient, Transparent Arguments for Generalised Inner Products and Polynomial Commitments, by Lee, Jonathan, in Theory of Cryptography, 2021 ↩

  6. Gemini: Elastic SNARKs for Diverse Environments, by Bootle, Jonathan and Chiesa, Alessandro and Hu, Yuncong and Orrú, Michele, in Advances in Cryptology – EUROCRYPT 2022, 2022 ↩

  7. Zeromorph: Zero-Knowledge Multilinear-Evaluation Proofs from Homomorphic Univariate Commitments, by Tohru Kohrita and Patrick Towa, in Cryptology ePrint Archive, Paper 2023/917, 2023, [URL] ↩

  8. Samaritan: Linear-time Prover {SNARK} from New Multilinear Polynomial Commitments, by Chaya Ganesh and Sikhar Patranabis and Nitin Singh, in Cryptology {ePrint} Archive, Paper 2025/419, 2025, [URL] ↩

  9. MERCURY}: A multilinear Polynomial Commitment Scheme with constant proof size and no prover {FFTs, by Liam Eagen and Ariel Gabizon, in Cryptology {ePrint} Archive, Paper 2025/385, 2025, [URL] ↩

  10. A Short Tutorial on Zero-Knowledge, by Oded Goldreich, 2010, [URL] ↩

  11. Mutator Sets and their Application to Scalable Privacy, by Alan Szepieniec and Thorkil Værge, in Cryptology ePrint Archive, Paper 2023/1208, 2023, [URL] ↩

  12. On the Size of Pairing-Based Non-interactive Arguments, by Groth, Jens, in Advances in Cryptology – EUROCRYPT 2016, 2016 ↩ ↩2

  13. Scalable Multi-party Computation for zk-SNARK Parameters in the Random Beacon Model, by Sean Bowe and Ariel Gabizon and Ian Miers, 2017, [URL] ↩

Search