Lecture

Interactive Proofs: The Power of Interaction

In course

Commodo consectetur quis ex Lorem ut elit Lorem est amet. Irure aute ad voluptate adipisicing proident dolore nostrud exercitation do excepteur culpa velit. Id aute fugiat cupidatat non sit reprehenderit aute incididunt ea voluptate irure. Minim anim occaecat id veniam ea aliqua nulla anim ipsum labore. Anim amet excepteur laboris enim ad magna culpa anim laborum voluptate. Exercitation ex qui sunt eiusmod eu veniam pariatur. Consequat do aliquip adipisicing minim aute et nisi nostrud in magna cillum.

Description

This lecture explores the concept of interactive proofs, focusing on topics such as zero-knowledge proofs, parallel composition, sequential composition, and the Goldreich-Micali-Wigderson protocol. It delves into the complexities of cryptographic protocols, soundness, zero-knowledge levels, and the relationship between complexity classes. The instructor discusses the Goldwasser-Micali-Rackoff protocol, graph coloring, and the Graph Isomorphism problem. The lecture also covers the Sigma Protocol, ZK Trick, and the notion of a malicious prover. Additionally, it examines the properties of E-protocols, proof of knowledge, and the implications of protocols as proof of knowledge.

Instructor

aliquip dolor in aliquip

Anim nulla velit veniam irure tempor aliquip. Voluptate consectetur ex esse tempor nisi officia cupidatat proident amet nostrud deserunt. Duis est laborum consectetur irure ad duis ullamco Lorem quis velit.

Official source

https://mediaspace.epfl.ch/media/0_gmatgg6g

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Ontological neighbourhood

Mathematics

Mathematical logic: Set theory

Discrete mathematics: Graph theory

Theoretical computer science

Theory of computation: Computational complexity theory

Statistics

Statistical inference: Mathematical statistics

Related lectures (29)

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.