🔥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

Excited to share our new work, DewTwo! DewTwo is the smallest known transparent pcs (with a 4.5 KB eval proof) built solely from falsifiable assumptions in groups of unknown order. A joint work with Benedikt Bünz ☕️, Tushar, and Sriram. Link: eprint.iacr.org/2025/129.pdf

The point is that strong idealized models are not well understood, so their use should be minimized. Still very impressed by the recent result of Dmitry Khovratovich , Ron Rothblum , and 🏴 levochka.eth 🏴 💙💛🇮🇱☀️🦁🗡️ (eprint.iacr.org/2025/118), but pretty sure it will not stop there. 3/3

📕 SNARGs Book Study Group 📕 It's a wrap! Huge thanks to A. Chiesa's students from @epfl_en Compsec lab who led these lectures: Giacomo Fenzi, Ϲhristian Knabenhans, Guy Weissenberg, Ziyi Guan, Christie Di, Yuxi Zheng 🙏 🙏 Find all recordings on our Youtube channel (link in next tweet)

STOC 2025 accepted papers. A whopping 219 papers accepted from 735 submissions. acm-stoc.org/stoc2025/accep… Conference in Prague June 23-27. acm-stoc.org/stoc2025

Exciting new work by Gal Arnon and Eylon! They suggest a new mitigation against our recent FS attack, which is different from our mitigation is several ways: 1. We suggested to increase the depth of the FS hash - they instead increase its “size”. 2. Interestingly, this

Years after Maryam Mirzakhani died at age 40, the Fields Medalist’s papers and emails helped guide two mathematicians to a proof about the strange, unintuitive shapes that had fascinated her. quantamagazine.org/years-after-th…

“Status Report on the Fourth Round of the NIST Post-Quantum Cryptography Standardization Process” selects HQC as the key establishment standard: csrc.nist.gov/pubs/ir/8545/f…

Just under two days to go! Submit your work to Crypto Valley Conference 2025!

I want to repeat that I and Janno Siim have open postdoc and PhD student positions. See crypto.cs.ut.ee/Main/OpenPosit… for more information. (Application deadline: 25 Apr.) Since PhD students might not know where Estonia is, I added more details to the above link (including salary).

Google’s ZK selective disclosure looks like it’s based on this paper that generates ZK arguments ECDSA “in 1.2 seconds on mobile devices depending on the credential size”. eprint.iacr.org/2024/2010

Accepted papers at TQC 2025. tqc-conference.org/accepted-talks/. Many interesting-looking titles!

Very interesting:

In our most recent session of Proof is in the Pudding, David Wong explores: + lattice-based proof systems + the threat of quantum computing on cryptography + and the first quantum-safe polynomial commitment scheme, Greyhound Timestamps: 0:00 Intro 4:35 Symmetric and