6.897 | Spring 2004 | Graduate

Selected Topics in Cryptography


The calendar below provides information on the lectures (L) for this course.

1 L1: Overview of the Course. The “Classic” Definitional Framework of Multiparty Function Evaluation (along the lines of [C00]): Motivation for the Ideal-Model Paradigm.

L2: The Basic Definition of Security. Variants.

2 L3: The Non-Concurrent Composition Theorem. Example: Casting Zero-Knowledge within the Basic Definitional Framework. The Blum Protocol for Graph Hamiltonicity.

L4: Sequential Composability of Zero-Knowledge. Problems with Non-Sequential Composability of Commitments and Zero-Knowledge.

3 L5: Theory of Cryptography Conference (TCC)

L6: Theory of Cryptography Conference (TCC) (cont.)

4 L7: The Universally Composable (UC) Security Framework: Motivation and the Basic Definition (based on [C01]).

L8: Alternative Formulations of UC Security. The Universal Composition Theorem. Survey of Feasibility Results in the UC Framework.

Homework 1 out in L8
5 L9: UC Commitments: Motivation. The Ideal Commitment Functionality. Impossibility of Realizations in the Plain Model.

L10: UC Commitment in the Common Reference String Model (based on [CF01]). Realizing the Ideal Commitment Functionality. The Multi-Commitment Functionality and Realization.

6 L11: UC Zero Knowledge from UC Commitments. Secure Realization of any Multi-Party Functionality with any Number of Faults: The Semi-Honest Case. (Static, Adaptive, Two-Party, Multi-Party.)

L12: Secure Realization of any Functionality: The Byzantine Case. The Case of Honest Majority without Set-Up.

Homework 1 due in L12
7 L13: Universal Composition with Joint State.

L14: UC Signatures. Equivalence with Existential Unforgeability Against Chosen Message Attacks (as in [GMRi88]). Usage for Certification and Authentication.

8 L15: Authenticated Key Exchange and Secure-Session Protocols.

L16: UC Formulation of Public-Key Encryption. Equivalence with CCA Security.

Homework 2 out in L16
9 L17: Electronic Voting/Introduction

L18: Electronic Voting/Introduction (cont.)

10 L19: Verifiable Mix-Nets

L20: Verifiable Mix-Nets (cont.)

Homework 2 due in L20

Homework 3 out in L20

11 L21: Verifiable Mix-Nets (cont.)

L22: Verifiable Mix-Nets (cont.)

12 L23: Chaum’s Voting Scheme

L24: Chaum’s Voting Scheme (cont.)

Homework 3 due in L23
13 L25: Pairing-Based Cryptography

L26: Pairing-Based Cryptography (cont.)

Homework 4 out one day after L25

Homework 4 due in L26

Course Info

As Taught In
Spring 2004
Learning Resource Types
Lecture Notes