
Behzad Abdolmaleki
@behzadabdolmal1
Cryptography Researcher at @shefcompsci, UK. Formerly at @maxplanckpress for SP, Germany.
ID: 1126811953106771968
https://sites.google.com/view/behzad-abdolmaleki/home 10-05-2019 11:31:19
149 Tweet
284 Followers
286 Following

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)






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).




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