Alessandro Chiesa

Web site:  Web site:  https://ssc.epfl.ch

Web site:  Web site:  https://sin.epfl.ch

EPFL IC IINFCOM COMPSEC
BC 245 (Bâtiment BC)
Station 14
CH-1015 Lausanne

vCard
Administrative data

Fields of expertise

Cryptography, Complexity Theory, Computer Security

Education

Ph.D.

Computer Science

MIT

2014

M.Eng.

Computer Science

MIT

2010

S.B.

Computer Science

MIT

2009

S.B.

Mathematics

MIT

2009

Teaching & PhD

Teaching

Computer Science

Communication Systems

PhD Students

Fenzi Giacomo, Guan Ziyi,

Foundations of Probabilistic Proofs

The discovery and study of probabilistic proof systems, such as PCPs and IPs, have had a tremendous impact on theoretical computer science. These proof systems have numerous applications (e.g., to hardness of approximation) but one of their most compelling uses is a direct one: to construct cryptographic protocols that enable super fast verification of long computations. This course introduces students to the foundations of probabilistic proof systems, covering both classical results as well as modern efficient constructions. The playlist of video lectures is here and the syllabus is here.

Courses

Advanced algorithms

A first graduate course in algorithms, this course assumes minimal background, but moves rapidly. The objective is to learn the main techniques of algorithm analysis and design, while building a repertory of basic algorithmic solutions to problems in many domains.