Computational Indistinguishability || @ CMU || Lecture 25b of CS Theory Toolkit @RyanODonnellTeaching
Computational Indistinguishability || @ CMU || Lecture 25b of CS Theory Toolkit  @RyanODonnellTeaching
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/)
Computational Indistinguishability || @ CMU || Lecture 25b of CS Theory ToolkitInformation Complexity || @ CMU || Lecture 24c of CS Theory ToolkitA problem re the k-Consistency Algorithm for CSPs  || @ CMU || Recitation 11 of CS Theory ToolkitMax-st-Flow is an LP || @ CMU || Lecture 18a of CS Theory Toolkit#48/100: |v⟩ and −|v⟩ are indistinguishable || Quantum Computer Programming in 100 Easy LessonsAlgorithms for Bounded Treewidth || @ CMU || Lecture 22(c) of CS Theory ToolkitSemidefinite relaxation problems || @ CMU || Recitation 10 of CS Theory ToolkitThe Math Behind Quantum Algorithms (in Scratch!)Quantum Monte Carlo: Mean Estimation when you have the source codeMin-st-Cut is the dual LP of Max-st-Flow || @ CMU || Lecture 18d of CS Theory ToolkitRounding LP Solutions: Min-Vertex-Cover || @ CMU || Lecture 18c of CS Theory ToolkitLearning About Quantum States 2:  Quantum Dice, and Measurements
Ryan ODonnell |

Computational Indistinguishability || @ CMU || Lecture 25b of CS Theory Toolkit

SHARE TO X SHARE TO REDDIT SHARE TO FACEBOOK WALLPAPER