Uploaded July 2020 | Updated November 2026, 2 hours ago
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 (rebeccakphoto.com/)
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 (rebeccakphoto.com/)










