Cryptography Nico Döttling and Julian Loss

News

18.05.2022

Quick Announcement

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... Read more

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
 

17.05.2022

Exam Dates

Dear Students,

the exam dates are:

  • Main Exam: Thu. 11.08.22  13:30
  • Re-Exam: Wed. 14.09.22 13:30
11.05.2022

Lecture tomorrow virtual only

Dear Students,

the lecture tomorrow the 12.05 will be virtual only on the usual zoom room.

10.05.2022

Lecture starts later today

Dear students,

Today's (10.05) lecture will start 15 minutes later, at 12:45. We will omit the mid-lecture 5minute break.

26.04.2022

Discord Server

Dear students,

we now have a discord server:

Join Crypto'22

Here you can ask questions to the tutors and let them know what you want to see in the tutorials.

20.04.2022

Online Tutorial Link

Dear students,

the link for the online tutorial can be found in the materials section. Note that the link itself might change but you can always find the newest link in the materials section.

14.04.2022

Tutorial registration

Dear students,

you can select your preferences for the tutorial slots now. The Wednesday 14:15 Tutorial is online and the rest of the tutorials are in person.

Show all
 

 

Cryptography

Lecture Period

The first lecture will be on Thursday 14.04.2022, the lecture will end Friday 21.07.2022.

Course Overview

Instructors: Nico Döttling and Julian Loss

This lecture will provide an introduction to the field of cryptography. Modern cryptography is the study of the design and analysis of systems with a guaranteed resilience against adversarial abuse. During the run of the course, we will cover the following topics:

  1. Basic Concepts of Modern Cryptography
  2. Basic Cryptanalysis
  3. Practical Aspects of Cryptography

Lecture Times and Place

The lecture will take place in the auditorium HS002 this year and at the following dates:

  • Tuesday 12:30 - 14:00
  • Thursday 12:30 - 14:00

For your convenience, we will make the recordings of last iterations of lecture available in the materials section. Be aware though that several topics may change this year.

Tutorials

Dates of the tutorials will be announced here.

Exercise Sheets

The will be a weekly exercise sheet which you can hand to qualify for the exams. If you score 40% of the achievable points across all exercise sheets you will qualify for the exams.

Literature

You can find complementary literature in the Semesterapparat.

Exams

The exams will be in person and on site. The dates for the exams are

  • Main Exam: Thu. 11.08.22  13:30
  • Re-Exam: Wed. 14.09.22 13:30


Privacy Policy | Legal Notice
If you encounter technical problems, please contact the administrators