Understanding Computational Indistinguishability & the Hybrid Argument | CMU CS Theory Lecture 25b 🔐
Explore the concept of computational indistinguishability for probabilistic ensembles and learn how the Hybrid Argument serves as a key tool in cryptographic proofs in Lecture 25b of CMU's CS Theory Toolkit.
Ryan O'Donnell
1.9K views • Jul 9, 2020
About this video
The definition of "computational indistinguishability" for probabilistic ensembles, and the main workhorse in crypto proofs: the Hybrid Argument. Lecture 25b of "CS Theory Toolkit": a semester-long graduate course on math and CS fundamentals for research in theoretical computer science, taught at Carnegie Mellon University.
Resource for this lecture:
"A course in cryptography" by Pass and Shelat.
Taught by Ryan O'Donnell (https://www.cs.cmu.edu/~odonnell)
Course homepage on CMU's Diderot system: https://www.diderot.one/course/28/
Thumbnail photo by Rebecca Kiger (https://www.rebeccakphoto.com/)
Resource for this lecture:
"A course in cryptography" by Pass and Shelat.
Taught by Ryan O'Donnell (https://www.cs.cmu.edu/~odonnell)
Course homepage on CMU's Diderot system: https://www.diderot.one/course/28/
Thumbnail photo by Rebecca Kiger (https://www.rebeccakphoto.com/)
Tags and Topics
Browse our collection to discover more content in these categories.
Video Information
Views
1.9K
Likes
21
Duration
13:46
Published
Jul 9, 2020
User Reviews
4.3
(1) Related Trending Topics
LIVE TRENDSRelated trending topics. Click any trend to explore more videos.