Boolean Circuits Courses
Moscow Institute of Physics and Technology via Coursera Lower Bounds in Complexity Theory, Communication Complexity, and Sunflowers - Toniann Pitassi
Institute for Advanced Study via YouTube Proof and Circuit Complexity - Robert Robere
Institute for Advanced Study via YouTube Undergrad Complexity at CMU - SAT
Ryan O'Donnell via YouTube Improved Non-Interactive Zero Knowledge with Applications to Post-Quantum Signatures
Association for Computing Machinery (ACM) via YouTube Wolverine - Fast, Scalable, and Communication-Efficient Zero-Knowledge Proofs for Boolean and Arithmetic Circuits
IEEE via YouTube Composition Theorems via Lifting
IEEE via YouTube Adaptively Secure Garbling with Near Optimal Online Complexity
TheIACR via YouTube Projective Arithmetic Functional Encryption and Indistinguishability Obfuscation From Degree
TheIACR via YouTube The Intensional-Extensional Problem in Probabilistic Databases
Simons Institute via YouTube