cryptimeleon

Welcome Paul @this_kramer to our group! After his very nice Master’s thesis about making lattice-based constructions more efficient using ideal lattices, Paul is going to continue working on lattice-based cryptography. 1/2 #crypto #pqc #lattice #upb

Denis Diemert (@de_diem) from BUW presenting the cool paper on tight security of TLS 1.3 PSK at Eurocrypt 2022, joint work with Hannah Davis, Felix Günther and @tiborja ia.cr/2022/246 #eurocrypt2022

For dogfooding, we reimplemented our old UACS point collection system (ia.cr/2019/169). Easily implemented. And: much better performance than our old implementation (without additional effort!). Really happy about how this turned out :)

Schnorr proofs are everywhere in privacy-preserving crypto and @cryptimeleon covers that, too. Thanks to Jeremy Fell’s great work (enabled by @DAAD_Germany’s RISE stipend), you can even let our compiler do most of the work (cptml.org/subzero).

This has been a long time coming 🥳. I’m especially proud of our computational model rework. g.pow(x).op(h.pow(r)).compute() is enough to compute a Pedersen commitment on a background thread with an efficient multiexponentiation algorithm. Really convenient!

Thanks to @CompScience_UPB and @dfg_public for the support and @JanBobolz, @FabianEidens, Heitjohann, and Jeremy for work on Cryptimeleon. Also a special thanks to @sebastinas_, @drl3c7er, @stephan_krenn for their input.

Recently @BenarrochDaniel also raised the question if we should force researchers to provide a reference implementation in papers. All that are interested take a look at cryptimeleon.org and give it a shot for your next privacy-preserving cryptography paper.

You want to know how fast prototyping of privacy-preserving cryptography is possible? Then jump right into the 5 minute tutorial of Cryptimeleon (cryptimeleon.org/getting-starte…) or read the paper (ia.cr/2021/961). It is an open-source Java library aimed at #crypto researchers.