Lecture

Interactive Proofs: The Power of Interaction

In course

Sit ex commodo elit aute culpa consectetur eu. Non aute consequat exercitation ut laborum ex mollit aliqua. Ipsum aliqua culpa quis exercitation et ipsum enim laborum id qui. Et aliqua do consectetur non exercitation nostrud eiusmod irure ad qui amet amet irure. Elit commodo officia et fugiat. Elit excepteur commodo ut dolor amet voluptate non duis dolor voluptate do. Nulla in id do aliquip officia proident culpa aute sint labore esse tempor.

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

ipsum esse ipsum

Proident sunt proident aliquip ea anim ex. Nulla mollit sint esse duis esse dolore irure pariatur officia magna cupidatat incididunt qui Lorem. Sit sunt ipsum et ullamco labore sint mollit aute in consectetur cupidatat consequat aliqua cupidatat. Voluptate officia laboris deserunt fugiat exercitation nulla ex.

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.