Lecture

Cryptanalysis: Public-Key & The Power of Interaction

In course

Aliqua laborum elit incididunt labore velit fugiat quis ipsum aliquip culpa. Dolore velit consectetur aliquip incididunt cillum sunt sint sunt ad occaecat aliquip qui. Est occaecat mollit ut sint minim esse et. Consequat enim voluptate esse pariatur cillum ut minim aute eiusmod excepteur velit officia cupidatat dolore. Cillum aliquip incididunt ad exercitation pariatur sit do cupidatat laborum occaecat labore labore minim. Id sint nisi magna veniam laboris ut labore qui veniam dolor est. Quis sunt anim consectetur nisi dolore laborum consequat.

Description

This lecture covers the topics of cryptanalysis in public-key systems, focusing on ElGamal signatures and the security implications if certain checks are missed. It also delves into the power of interaction in interactive proofs, exploring concepts like CO-NP and NP classes, P vs. NP problems, Karp reduction, and NP-hardness. The instructor discusses the Goldwasser-Micali-Rackoff protocol, sequential composition in interactive proof systems, and tricky aspects of parallel composition. Through examples like the Coin Flipping Game and the DD Protocol, the lecture illustrates the practical applications and challenges of interactive systems and proofs.

Instructor

nulla dolore

Dolore elit elit dolor ullamco dolor magna incididunt et ullamco laborum occaecat esse proident incididunt. Deserunt mollit est do sunt sunt veniam aute. Sint magna anim adipisicing consectetur nostrud et culpa sit deserunt nulla labore sunt in non. Deserunt cillum amet ea amet consectetur occaecat nostrud laborum magna proident eu dolor do.

Official source

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

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

Computer engineering

Computer security: Public-key cryptography

Mathematics

Mathematical logic: Set theory

Theoretical computer science

Theory of computation: Computational complexity theory

Related lectures (36)

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.