Cryptographic protocols (Autumn 2008)

Time and location

Event	Time	Location
Lectures and practice sessions	Mon 12:15 - 13:45	Liivi 2-315	Peeter Laud
	Tue 14:15 - 17:45	Liivi 2-404
	Wed 10:15 - 11:45	Liivi 2-404
(weeks 9—16)

Grading is based on a number of take-home exercises during the course (making up two thirds of the grade) and an oral exam sometime after the lectures have ended (making up the rest of the grade) (if someone wants to make the exam in written form, this can be discussed).

• The examination paper (if there will be one) will contain questions that are less suitable for take-home exercises.
• The exam is open-book (but closed-laptop).

The contents of the lectures is similar to the previous year. There is no single textbook that covers all material of the course. The first lectures somewhat (but only somewhat) follow certain chapters of Wenbo Mao's "Modern Cryptography: Theory and Practice".

Home exercises:

• First (deadline: end of November)
• Second (deadline: mid-December)
• Third (deadline: mid-December)
• The fourth and last home exercise is out, too. See slide 48 (which is page 57) in the slides about universal composability. Deadline: mid-January.

News:

• Dec 16th I came up with a list of topics for oral exam. We are going to somehow randomly pick one of these topics about an hour before your exam.
• Dec 11th The lecture in December 15th will be given by Dan Bogdanov.
• Dec 1st Advertisement: Prof. Reinhard Wilhelm, who has just been awarded the honorary doctorate of Tartu University, will give a talk titled “Timing analysis for real-time programs” at December 2nd, 10:15 in Liivi 2-111.
• Dec 1st Second and third home exercises have been posted.
• Nov 19th I will not be in Estonia during the last week of November (24th-28th). During that time, some of the lectures will be given by Helger Lipmaa. In particular, he will give the lecture on Monday and on Tuesday from 14 o'clock. He will tell you the more precise schedule when you meet him.
• Nov 2nd: The first home exercise has been posted.
• Nov 2nd: There are no lectures in November 4th and 5th.
• Oct 22nd: The first lecture is at October 27th!

Slides of the lectures:

• October 27th and the following day(s)
• On October 28th, we continued from where we left off. Afterwards we also looked at analysing protocols with ProVerif. The example proceeded from here via here to here.
• On October 29th, we continue, there are more examples. After that we will look at a couple of "real-life" protocols.
• On November 3rd, we take a look at some more protocols with interesting properties, discuss the home exercise, and if we still have time, continue with a key (meta-)lemma in cryptographic reductions.
• On November 10th, we continue, and also start with the equivalence of formal and computational models.
• On November 11th, we continue. Also start with general multiparty computation.
• On November 17th, we continue. Also talk about secret sharing.
• Actually, we start with secret sharing in November 18th. After that, we will see more multiparty computation protocols.
• This goes on in November 19th.
• Helger's slides for the last week of November are here.
• On December 1st, we consider the implementation of the broadcast channel from point-to-point channels, see a MPC protocol based on threshold homomorphic encryption, and discuss the home exercises. The slides have been extended.
• On December 2nd, we start with universal composability. This topic will continue for several following lectures.
• On December 10th, we talk about the universally composable cryptographic library.