6.897 Selected Topics in Cryptography

Spring 2004

Securely realizing an ideal functionality F.
Securely realizing an ideal functionality F. (Image courtesy of Brett Paci.)

Course Highlights

This course features complementary lecture notes and scribe notes in the lecture notes section. In addition an extensive bibliography of assigned and recommended readings is provided in the readings section.

Course Description

This course covers a number of advanced "selected topics" in the field of cryptography. The first part of the course tackles the foundational question of how to define security of cryptographic protocols in a way that is appropriate for modern computer networks, and how to construct protocols that satisfy these security definitions. For this purpose, the framework of "universally composable security" is studied and used. The second part of the course concentrates on the many challenges involved in building secure electronic voting systems, from both theoretical and practical points of view. In the third part, an introduction to cryptographic constructions based on bilinear pairings is given.
Donate Now

Staff

Instructors:
Prof. Ran Canetti

Course Meeting Times

Lectures:
Two sessions / week
1.5 hours / session

Level

Graduate