🔥The 9th Round of Easy Loan, Earn $40 Reward is in progress❗️ ⏰ Promotion Period: January 15th - Feburary 15th, 2025 👉 Register now and check more details at gate.io/campaigns/358

Today's my last official day at CMU, making this announcement long overdue: I'm headed to Indiana University IU Luddy this fall as an Assistant Professor of Computer Science! I'm truly thrilled to return to Bloomington as a member of the PL group that introduced me to the area.

New work on folding, with Abhiram Kothapalli! Full paper: eprint.iacr.org/2023/1192.pdf

It’s hard to overstate the influence of the original recursive inner-product argument [BCCGP16] on modern folding techniques. As this work mentions, we can thank Bayer and Groth [BG12] for the brilliant idea to interactively reduce a claim to a smaller claim of the same form.

Had a great time giving a talk on HyperNova! At #sbc2023. Slides are here: drive.google.com/file/d/1Xp37Mt…

I'm excited to (belatedly) announce that I will be joining Cornell Computer Science as an assistant prof in Fall 2024! I'll be hiring students this cycle -- if you or anyone you know is interested a PhD in cryptography, quantum computing, or probabilistic proof systems, please get in touch :)

Using Nova over secp/secq, proving time for 300 aggregated secp256k1 sigs is clocking at 8.44s on my mac. I ported it to wasm, you can try it from your browser - tested on desktop chrome. Writeup: hackmd.io/mArMuUx5TC2LEc… App: …browser-ecdsa-web-dmpierre.vercel.app Repo: github.com/dmpierre/nova-…

CycleFold (a recent approach to instantiate folding-scheme-based arguments over a cycle of elliptic curves) visualized

BaseFold (eprint.iacr.org/2023/1705.pdf) is finally out! With Hadas Zeilberger and Ben Fisch ☕️ , we build a transparent and post-quantum-secure commitment scheme for multilinear polynomials that achieves better tradeoff between prover time and proof size/verifier cost.

🔐💡 Dive into zero-knowledge folding schemes using the github.com/lurk-lab/aweso… repository! If you're interested in the recent avalanche of #ZeroKnowledge papers, code explorations, and podcasts, this is your go-to resource. #ZKPs #Cryptography #Blockchain #Privacy

I am recruiting multiple PhD students to join my lab at UCSD CSE starting Fall '24! Our group will focus on security and safety in networked sociotechnical systems. Learn about my work and my advising style: kumarde.com/prospective_st… And apply by Dec 20: cse.ucsd.edu/graduate/admis…

If you are thinking about doing a Ph.D in cryptography or any other blockchain related topic you should apply to NYU courant. We have an amazing crypto and security group with Sunoo Park, Yevgeniy Dodis, Marshall Ball, Nir Bitansky, Joseph Bonneau, and Mike Walfish. Also New York City!

We wrote a short note introducing BabySpartan, a SNARK for (non-uniform) Plonkish arithmetization where the prover only commits to “small” values (when the witness contains small field elements). The note is here: eprint.iacr.org/2023/1799.pdf.

Thrilled to share that I will start a tenure-track assistant professor position in the CS department at Boston University! I am looking for PhD students in the area of programming languages with applications to distributed systems, cryptography, and machine learning.

Great example of an elaborate system neatly presented in the reductions of knowledge framework. Excited to see what more we can do with this language.

I just gave a talk on BabySpartan at Privacy & Scaling Explorations Learn & Share session! We think this is the most prover-efficient SNARK for Plonkish constraint systems. In the talk I describe BabySpartan specifically for Plonkish: drive.google.com/file/d/1i_zym-… 🧵

congratulations to Ph.D. Bolton Bailey Bolton Bailey for completing his thesis defense on formalizing soundness of SNARKS in Lean/mathlib, including an axiom for schwartz-zippel, proof of linear PCP snarks (groth16), proof (sketch) for PIOPs (Marlin) eprint.iacr.org/2023/656.pdf

Two open PH.D. positions in my group at School of Computer Science, University of Sydney! The topic is broadly in cryptography and more info can be found here. sydney.edu.au/research/oppor… Feel free to contact me if interested, and pass on to your contacts.

Today I’m happy to share two articles I've been working on for the past few weeks! 1. SuperSpartan by Hand: anoma.net/blog/superspar… 2. HyperNova by Hand: anoma.net/blog/hypernova… It’s been fun writing them and delving into such detail has proven to be incredibly insightful for me.

The security group at Microsoft Research is looking for research interns in various areas, including ZKPs, confidential computing, and formal verification of systems. If you are a PhD student interested in any of these areas, please apply here: jobs.careers.microsoft.com/global/en/job/…

Introducing MicroNova, a new variant of Nova that features an efficient on-chain verifier: eprint.iacr.org/2024/2099.pdf