SNARGs Courses and Certifications

BARGs Implies SNARGs and Connection to Non-Signaling PCPs - Lecture 9

Delve into advanced cryptography concepts exploring the relationship between BARGs, SNARGs, and non-signaling PCPs, building on fundamental theoretical frameworks and their practical implications.

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

BARGs Implies SNARGs and Connection to Non-Signaling PCPs - Lecture 9

Delve into advanced cryptography concepts exploring the relationship between BARGs, SNARGs, and non-signaling PCPs with MIT professor Yael T. Kalai's detailed technical analysis.

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

Simons Institute

A Pure Indistinguishability Obfuscation Approach to Adaptively-Sound SNARGs for NP

Discover how to construct adaptively-sound SNARGs for NP using only indistinguishability obfuscation and one-way functions, eliminating the need for additional algebraic assumptions.

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

Simons Institute

Towards SNARGs for NP from Standard Assumptions

Explore recent advances in constructing SNARGs for NP from standard cryptographic assumptions, bypassing indistinguishability obfuscation requirements.

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

Simons Institute

SNARGs for P/poly from SIS

Discover new constructions of succinct non-interactive arguments for circuits based on SIS assumption, featuring transparent setup and fast verification without random oracles.

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

Advanced Topics in Cryptography

Delve into advanced cryptographic proof systems, from interactive proofs to SNARGs, exploring their evolution and applications in modern computer science and security protocols.

• MIT OpenCourseWare
• Self-Paced
• Free Online Course

Simons Institute

Batch Arguments for NP and SNARGs for P from LWE

Explore advanced cryptographic concepts like batch arguments for NP and SNARGs for P, derived from Learning With Errors (LWE) assumptions, in this technical talk by Abhishek Jain.

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

Simons Institute

SNARGs Beyond Non-Signaling

Explores construction of SNARGs for monotone policy batch NP languages under LWE assumption, introducing predicate-extractable hash families as a novel approach beyond non-signaling PCPs.

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

Simons Institute

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

TheIACR

Quasi-Optimal SNARGs via Linear Multi-Prover Interactive Proofs

Explore quasi-optimal SNARGs and linear multi-prover interactive proofs in cryptography, covering key concepts, implementations, and open challenges in this cutting-edge field.

• YouTube
• 25 minutes
• Self-Paced
• Conference Talk

TheIACR

Lattice Based SNARGs and Their Application to More Efficient Obfuscation

Explore lattice-based SNARGs and their role in enhancing obfuscation efficiency. Learn about multilinear maps, bootstrapping, and linear PCPs in cryptography.

• YouTube
• 24 minutes
• Self-Paced
• Conference Talk

Advanced Topics in Cryptography - Fall 2023

Explore the evolution of proofs in computer science through interactive proofs, multi-prover systems, and probabilistically checkable proofs, then convert them into SNARGs using cryptography.

• YouTube
• 22 hours 35 minutes
• Self-Paced
• Free Video

Simons Institute

Succinct Obfuscation via Propositional Proofs - How to Use pv-IO

Discover advanced techniques for minimizing obfuscation size through propositional proofs, exploring fully succinct IO where program size depends only on secret components, not public parts.

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

Simons Institute

Succinct Non-interactive Arguments of Proximity

Explore advanced cryptographic proof systems enabling verification of extremely long statements through short messages and sublinear reading, featuring novel commitment schemes.

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

Simons Institute

An Introduction to Commitment-Based Succinct Arguments

Discover how succinct arguments combine probabilistic proofs with cryptographic commitments through an elegant unified framework that illuminates the SNARG landscape.

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