Friday seminar: Lightweight, Realtime Solutions to the Privacy and Security Issues in the Internet of Vehicles (IoV)

, 1:00 pm

Friday seminar: Concatenated Codes for Multiple Reads of a DNA Sequence

, 1:00 pm

Friday seminar: Counting Vampires: From Univariate Sumcheck to Updatable ZK-SNARK

, 2:00 pm

More Efficient Shuffle Argument from Unique Factorization

Toomas Krips and Helger Lipmaa. More Efficient Shuffle Argument from Unique Factorization. In Kenny Paterson, editor, CT-RSA 2021, volume 12704 of Lecture Notes in Computer Science, pages 252–275, San Francisco, CA, USA, May 17–21, 2021. Springer, Cham. 10.1007/978-3-030-75539-3_11.