General

Browse all posts in the General category.

25 to 30 of 36

15JUN 2021
General
Talk by Aniket Kate: “Designing and Analyzing Network Anonymity Solutions”
On 2 July 2021 at 16:30 CEST, Aniket Kate will give a talk titled “Designing and Analyzing Network Anonymity Solutions”. You can join the Zoom meeting using the following details: https://fau.zoom.us/j/93409361471?pwd=YUZ2NFZYcGRBME5zUys4aTd4VmdtQT09 Meeting ID: 934 0936 1471 Passcode: 942451 Abstract: The onion routing (OR) network Tor is undoubtedly the most widely employed technology for anonymous web access. […]On 2 July 2021 at 16:30 CEST, Aniket Kate will give a talk titled “Designing and Analyzing Network Anonymity Solutions”. You can join the Zoom meeting using the following details: https://fau.zoom.us/j/93409361471?pwd=YUZ2NFZYcGRBME5zUys4aTd4VmdtQT09 Meeting ID: 934 0936 1471 Passcode: 942451 Abstract: The onion routing (OR) network Tor is undoubtedly the most widely employed technology for anonymous web access. […]
Read more about Talk by Aniket Kate: “Designing and Analyzing Network Anonymity Solutions”
09JUN 2021
General
Talk by Jonathan Bootle: “Sumcheck Arguments and their Applications”
On 9 July 2021 at 16:00 CEST, Jonathan Bootle will give a talk titled “Sumcheck Arguments and their Applications”. You can join the Zoom meeting using the details provided here. Abstract: In this talk, I will present sumcheck arguments; a new class of interactive protocols which show that „split-and-fold protocols“ (such as Bulletproofs and many more) […]
Read more about Talk by Jonathan Bootle: “Sumcheck Arguments and their Applications”
25MAY 2021
General
“Subtractive Sets over Cyclotomic Rings: Limits of Schnorr-like Arguments over Lattices” Accepted to CRYPTO 2021
The paper “Subtractive Sets over Cyclotomic Rings: Limits of Schnorr-like Arguments over Lattices” has been accepted to CRYPTO 2021. This is a joint work of Russell W. F. Lai with Martin R. Albrecht. Below you will find the abstract of the paper. We study when (dual) Vandermonde systems of the form admit a solution over a […]
Read more about “Subtractive Sets over Cyclotomic Rings: Limits of Schnorr-like Arguments over Lattices” Accepted to CRYPTO 2021
25MAY 2021
General
“On Multi-Channel Huffman Codes for Asymmetric-Alphabet Channels” Accepted to ISIT 2021
The paper “On Multi-Channel Huffman Codes for Asymmetric-Alphabet Channels” has been accepted to the 2021 IEEE International Symposium on Information Theory. This is a joint work of Russell W. F. Lai with Hoover H. F. Yin, Xishi Wang, Ka Hei Ng, Lucien K. L. Ng, and Jack P. K. Ma. Below you will find the abstract […]
Read more about “On Multi-Channel Huffman Codes for Asymmetric-Alphabet Channels” Accepted to ISIT 2021
03JUL 2020
General
Prof. Dr. Dominique Schröder on the Security of Telegram
For the article „Das Telegram Prinzip“ dd. 21 May 2020, Prof. Dr. Dominique Schröder spoke to German newspaper Süddeutsche Zeitung about the security of the instant messaging app Telegram.
Read more about Prof. Dr. Dominique Schröder on the Security of Telegram
11MAY 2020
General
Prof. Dr. Dominique Schröder as External Consultant for the Patient Data Protection Law
On 27 May 2020, Prof. Dr. Dominique Schröder will speak as an external consultant for the Committee on Health. The public consultation is about the patient data protection law.
Read more about Prof. Dr. Dominique Schröder as External Consultant for the Patient Data Protection Law