Awesome crypto

Blog posts

Group theory

Math

(Zero-knowledge) proof systems

Papers to read

  • Verifiable Oblivious Pseudorandom Functions from Lattices: Practical-ish and Thresholdisable1
  • NeutronNova: Folding everything that reduces to zero-chec2

  1. Verifiable Oblivious Pseudorandom Functions from Lattices: Practical-ish and Thresholdisable, by Martin R. Albrecht and Kamil Doruk Gur, in Cryptology {ePrint} Archive, Paper 2024/1459, 2024, [URL] 

  2. NeutronNova}: Folding everything that reduces to zero-check, by Abhiram Kothapalli and Srinath Setty, in Cryptology {ePrint} Archive, Paper 2024/1606, 2024, [URL]