Cryptography

Dear Students,

I've uploaded the slides and videos from the previous week's lectures. I found and corrected some minor typos during post-editing and tried to highlight some parts a bit better on the final version of the slides. Please cross-reference the lecture videos with these corrected versions and, as usual, feel free to reach out if you have any further questions.

Best,

Julian

Dear Students,

I just uploaded the slides and recorded lectures from the past two weeks. There was an issue with recording on the lecture on Tuesday last week which I noticed too late, so that recording is unfortunately not available. However, the content of that lecture is very similar to last year's lecture on public key encryption, so please watch Nico's recording of last year's lecture on the first part of PKE.

Due to a lot of spontaneous interaction with the students who attended the lecture yesterday, I was not happy with how the proof of hashed ElGamal ended up looking on my slides. Hence, I redrew the proof sketch and recorded a short video that goes through the updated proof slides in detail again.

Best,

Julian

Dear Students,

As you are probably aware, there was a problem with the eduroam in HS002 on Tuesday, 7.6.22. As a result, it was not possible for me to record the lecture. Given that the eduroam is back up today, I should be able to record the lecture as usual.

*Please also note that I have updated the zoom link for the lecture in the description for the remainder of the term*.

Best, Julian

For those interested, our CISPA distinguished lecture will start in a few moments, invitation below:

As part of CISPA’s Distinguished Lecture Series, we are happy to
announce that Huijia (Rachel) Lin (University of Washington) will give a talk on

How to Hide Secrets in Software? 

on Wed, May 18, 2022, at 17:00am via Zoom on
https://cispa-de.zoom.us/j/93997221436?pwd=QlRzT3RPS2ZKM1BSRVEvc2xoV2R1dz09


Abstract:
At least since the initial public proposal of public-key cryptography based on computational hardness assumptions (Diffie and Hellman, 1976), cryptographers have contemplated the possibility of a “one-way compiler” that translates computer programs into “incomprehensible” ones that compute the same function. In this talk, we will describe a mathematical formalization of this goal known as  indistinguishability obfuscation (iO). Over the past decade, It has been demonstrated that iO is a fascinating and powerful tool that enables a host of new cryptographic goals and beyond. We then show how to construct iO based on three well-studied hardness assumptions.
Joint work with Aayush Jain at CMU and Amit Sahai at UCLA. 


Bio:
Huijia (Rachel) Lin is an Associate Professor in the Paul G. Allen School of Computer Science and Engineering at the University of Washington, where she co-leads the Cryptography Lab. Before joining the University of Washington, she was an Assistant Professor in the Department of Computer Science at the University of California, Santa Barbara. Earlier, she obtained a PhD in Computer Science from Cornell University, and was a post-doctoral researcher at MIT Computer Science and Artificial Intelligence Laboratory (CSAIL) and Department of Computer Science at Boston University. Her research interests are in Cryptography, and its interplay with theory of computer science and security. She is a recipient of a US National Science Foundation CAREER award, a Hellman Fellowship, a best paper award honorable mention at Eurocrypt 2016, and best paper awards at Eurocrypt 2018 and STOC 2021.


Best regards,
Nico Döttling