Simons Institute Courses

Constant-Round Arguments from One-Way Functions

Explore constant-round argument systems for log-space uniform circuits, achieving almost-linear verification time using only one-way functions, advancing cryptographic protocol efficiency.

• YouTube
• 43 minutes
• Self-Paced
• Free Video

Assumptions in Cryptography and Complexity Theory

Explore key assumptions in cryptography and complexity theory through an expert panel discussion, delving into minimal complexity requirements for cryptographic systems.

• YouTube
• 29 minutes
• Self-Paced
• Free Video

Mutual Empowerment Between Circuit Obfuscation and Circuit Minimization

Exploring connections between Indistinguishability Obfuscation and Minimum Circuit Size Problem, revealing implications for cryptography and computational complexity theory.

• YouTube
• 37 minutes
• Self-Paced
• Free Video

Tales of Obfuscation in Bounded Arithmetic, Metacomplexity, and Differential Privacy

Explores obfuscation's role in theoretical computer science, covering Circuit Range Avoidance, metacomplexity of Kolmogorov complexity, and computational differential privacy, with focus on recent results and open questions.

• YouTube
• 48 minutes
• Self-Paced
• Free Video

Tutorial on Obfuscation

Explore minimal complexity assumptions for cryptography, focusing on obfuscation techniques and their applications in secure system design.

• YouTube
• 1 hour 4 minutes
• Self-Paced
• Free Video

Fine-Grained Cryptography

Explore minimal complexity assumptions in cryptography, focusing on fine-grained approaches that provide strong guarantees against restricted adversarial classes.

• YouTube
• 54 minutes
• Self-Paced
• Free Video

On the Complexity of Two-Party Differential Privacy

Explores limitations and cryptographic requirements for distributed differential privacy in two-party functions like inner product and Hamming distance, with implications for data analysis and privacy.

• YouTube
• 40 minutes
• Self-Paced
• Free Video

Communication Complexity, Streaming and Computational Assumptions

Explore how computational limitations and cryptographic tools can bypass impossibility results in communication complexity and streaming, with examples and open problems discussed.

• YouTube
• 1 hour 1 minute
• Self-Paced
• Free Video

New Techniques for Zero-Knowledge- Leveraging Inefficient Provers to Reduce Assumptions

Explores novel approaches in zero-knowledge proofs, focusing on transforming NIZK to ZAPs with inefficient provers. Discusses implications for cryptographic assumptions and fine-grained complexity settings.

• YouTube
• 38 minutes
• Self-Paced
• Free Video

Hard Languages in NP ∩ coNP and NIZK Proofs from Unstructured Hardness

Explores unstructured hard languages in NP ∩ coNP, providing evidence for their existence and introducing a new NIZK proof construction, advancing understanding of computational complexity and cryptography.

• YouTube
• 49 minutes
• Self-Paced
• Free Video

Non-Interactive Universal Arguments

Explore the concept of universal arguments and their construction for non-deterministic computations, focusing on recent developments in non-interactive succinct arguments and their universality.

• YouTube
• 45 minutes
• Self-Paced
• Free Video

Rate-1 BARGs via Fully-Local SSB Hash Families

Explore fully-local SSB hash families and their applications in cryptography, including multi-hop aggregate signatures and incrementally verifiable computation.

• YouTube
• 46 minutes
• Self-Paced
• Free Video

Correlation Intractability and SNARGs from Sub-exponential DDH

Explore groundbreaking constructions of SNARGs and correlation-intractable hash functions based on sub-exponential DDH, achieving poly-logarithmic proof sizes for Batch-NP and P.

• YouTube
• 44 minutes
• Self-Paced
• Free Video

Tutorial on Proof Systems

Explore minimal complexity assumptions in cryptography, focusing on proof systems and their applications in secure computation and blockchain technology.

• YouTube
• 1 hour 8 minutes
• Self-Paced
• Free Video

Building Human Intelligence at Scale, to Save the Next Generation from ChatGPT

Innovative approaches to scale human intelligence and education in the era of AI, drawing from game theory and real-world problem-solving experiences across mathematics, pandemic control, and live math education.

• YouTube
• 1 hour 31 minutes
• Self-Paced
• Free Video