Trial Lecture: Coding for Flash Memories: State-of-the-art and Challenges

08.05.2024
, 10:00 am

Trial Lecture: Secure Randomness Generation

29.04.2024
, 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.

keyboard_arrow_up