Bonn-Aachen International Center
for Information Technology

cosec >students >Teaching >Winter 2008/2009

Seminar Advanced Topics in Crytography

Corresponding entry in Aachen Campus, Bonn University.

Lecture

Michael Nüsken

Time & Place

Thursday 10⁰⁰- 12⁰⁰, b-it 1.25.

First meeting: Thursday, 30 October 2008, 10⁰⁰, b-it 1.25.

Prerequisites

Basic knowledge of cryptography and fast understanding of mathematical and computer science topics is required.

Contents

This semester's seminar focusses on Zero-Knowledge and maybe PCP.

Schedule

So far we have gone through complexity theory, pseudorandom generators and zero-knowledge.

15 January 2009, 10⁰⁰.
Laila El Aimani, ZK=IP.
Laila El Aimani, Witness hiding.
15 January 2009, 10⁰⁰.
Daniel Loebenberger: IP=PSPACE.
22, 29 January 2009, 10⁰⁰.
T. Jonas Özgan: Proofs of knowledge.
5 February 2009, 10⁰⁰; Thursday, 19 February, 10⁰⁰.
Yona Raekow: Definition and use of PCP.
Literature:
- Madhu Sudan (2000). Probabilistic Checkable Proofs. Lecture Notes, scribe: Venkatesan Guruswami.
- Luca Trevisan (2006). PCP and Hardness of Approximation. Lecture Notes, in particular Lectures 1, 2 and 13.
- Venkatesan Guruswami and Ryan O'Donnell (2006). The PCP Theorem and Hardness of Approximation. Lecture Notes, in particular lectures 1, 2.
- Jaikumar Radhakrishnan and Madhu Sudan (2006). On Dinur's proof of the PCP theorem.
- Irit Dinur and Dana Moshkovitz (2008). Probabilistically Checkable Proofs. Lecture notes.

Literature

Oded Goldreich, Foundations in Cryptography, volume I.

Allocation

S2.

Media Informatics, Communication Skills.
University of Bonn - Computer Science, A or A1.
University of Bonn - Mathematics, ??.

Imprint, webmaster & more