Interactive Proofs: The Power of Interaction

About
Privacy
Disclaimer

Graph Chatbot

Related lectures (28)

Page 1 of 3

The Power of Interaction: Zero-Knowledge Construction

Explores zero-knowledge construction, setup models, and the power of interaction in cryptographic protocols, including Sigma Protocol and NP Zero-Knowledge Proofs.

Cryptanalysis: Public-Key & The Power of Interaction

Explores cryptanalysis in public-key systems and the power of interaction in interactive proofs, covering CO-NP, NP classes, P vs. NP, and more.

Graphical Models: Representing Probabilistic Distributions

Covers graphical models for probabilistic distributions using graphs, nodes, and edges.

Complex Systems: Critical Phenomena

Explores critical phenomena in complex systems, including stochastic objects, percolation, and combinatorial optimization.

Complexity & Induction: Algorithms & Proofs

Covers worst-case complexity, algorithms, and proofs including mathematical induction and recursion.

Elements of Computational Complexity

Introduces computational complexity, decision problems, quantum complexity, and probabilistic algorithms, including NP-hard and NP-complete problems.

Elements of computational complexity

Covers classical and quantum computational complexity concepts and implications.

Graph Coloring: Theory and Applications

Covers the theory and applications of graph coloring, focusing on disassortative stochastic block models and planted coloring.

Information Measures: Entropy and Information Theory

Explains how entropy measures uncertainty in a system based on possible outcomes.

Sparsest Cut: Bourgain's Theorem

Explores Bourgain's theorem on sparsest cut in graphs, emphasizing semimetrics and cut optimization.