[Call for participation] #ICALP2022 Early registration is open until May 11th, 2022. Late registration starts from May 12th, 2022. ℹ For more details and to register, follow this link: 🔗icalp2022.dakini-pco.com

TCC 2022 Call for Papers is up, please submit your best work in crypto theory! tcc.iacr.org/2022/callforpa… Vinod Vaikuntanathan

Congratulations to Zvika Brakerski, Craig Gentry, and Vinod Vaikuntanathan, winners of the 2022 Gödel prize. sigact.org/prizes/g%C3%B6…

Yeah, KYBER and Dilithium will become primary NIST standard! 💪🥳🎉 Congrats to my co-authors! csrc.nist.gov/projects/post-…

👏Congratulations to Z. Brakerski Weizmann Institute, C. Gentry and V. Vaikuntanathan MIT EECS, winners of the 2022 Gödel Prize. Their papers made transformative contributions to #cryptography by constructing efficient fully homomorphic encryption schemes. 🔗url.irif.fr/ro3tv

#ePrint An efficient key recovery attack on SIDH (preliminary version): W Castryck, T Decru ia.cr/2022/975

OK, you have the code generating a random variable Y. You only have enough time to run it O(n) times. In this world of ours, is there any method to estimate μ to, say, ±σ/n^{.51}? (With probability at least 99%.)

Answer to poll: Yes (since QM exists in this world)! Yassine Hamoudi proved this in his terrific PhD thesis: yassine-hamoudi.github.io/files/other/Ph… Given code (classical or quantum) to sample Y, and time for O(n) samples, his quantum algorithm whp estimates E[Y] to ±σ/n', where n'=n/polylog(n)

Pro tip for getting into quantum research: write a classical paper with half-baked, shady proofs. Congratulations! You now have a paper with quantum proofs: fine as long as no one looks at them, but they will collapse as soon as reviewers have a look.

We spent some time to make a comprehensive list of use of MPC (and some other PETs) in classical finance and Defi. With James Chiang, Bernardo and Tore.

🔐Peut-on contrôler l'accès aux sites #pornographiques tout en conservant l'#anonymat des utilisateurs ainsi que leurs #données ? Geoffroy Couteau et Pierre-Évariste Dagand réfléchissent à créer une identité numérique en passant par le "zero-knowledge proof".

Very happy to share that I just received an ERC Starting Grant! Wanna work on how to make apps and the Internet more secure? Look out for upcoming opportunities in Paris! ins2i.cnrs.fr/fr/cnrsinfo/ge…

Wei-Kai Lin, Ethan Mook and Daniel Wichs devised a new method for privately searching large databases. “[This is] something in cryptography that I guess we all wanted but didn’t quite believe that it exists,” said Vinod Vaikuntanathan, a researcher at MIT. quantamagazine.org/cryptographers…

[📢 We are hiring - Postdoc position] We invite applications for several fully-funded postdoctoral positions (1-2 years) to work on cryptography. Areas of interest include, but are not limited to, zero-knowledge proofs, [...]

An extremely surprising and important result! Counter-examples for random-oracle constructions are typically contrived. Here is a very real and very worrying one for a succinct proof system in use!