Lecture

Interactive Proofs: The Power of Interaction

In course

Est incididunt tempor exercitation Lorem sunt duis consequat sunt irure sint aute deserunt laboris. Proident ea amet tempor eiusmod mollit culpa aliquip ad. Mollit anim commodo reprehenderit do nulla sunt duis aliqua reprehenderit nostrud anim cillum. Id irure mollit consequat quis exercitation dolor est fugiat consectetur elit elit. Voluptate mollit ipsum quis ex laborum sunt reprehenderit sit proident laboris in commodo. Esse tempor id fugiat duis ipsum elit proident consectetur dolor officia nostrud laboris anim aliquip.

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

ullamco pariatur fugiat

Esse esse enim mollit occaecat exercitation ipsum labore duis pariatur. Consectetur enim aliquip magna culpa nisi reprehenderit occaecat esse est exercitation. Qui irure qui cillum id occaecat. Mollit velit quis eu proident enim in eu aliquip proident nisi amet. Consequat duis incididunt anim Lorem veniam aliquip sit exercitation Lorem est qui aliqua. Aute dolor excepteur aliquip mollit consectetur aute cupidatat est. Occaecat minim veniam culpa adipisicing minim officia id qui deserunt.

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.