Secure Computation Courses and Certifications

Simons Institute

Willow - Secure Aggregation with One-Shot Clients

Discover a novel secure vector summation protocol enabling dynamic client participation without synchronization, reducing latency while maintaining computational efficiency.

• YouTube
• 40 minutes
• On-Demand
• Free Video

Simons Institute

Geometry of Secure Computation

Explore the geometric framework for secure computation, focusing on round and communication complexity for randomized-output functions. Learn about innovative approaches to long-standing cryptography challenges.

• YouTube
• 48 minutes
• On-Demand
• Free Video

TheIACR

Secure Multi-Party Computation and Secret Sharing - Session 1 and 2

Explore the fundamentals of Multi-Party Computation and Secret Sharing techniques in cryptography, including key concepts, applications, and recent advancements in the field.

• YouTube
• 1 hour 10 minutes
• On-Demand
• Free Video

TheIACR

New Techniques for Efficient Secure Computation

Explore cutting-edge techniques for efficient secure computation with renowned cryptographer Yuval Ishai in this insightful PPML 2021 invited talk.

• YouTube
• 56 minutes
• On-Demand
• Conference Talk

TheIACR

Cryptographic Protocols and Secure Computation II

Explore advanced cryptographic protocols and secure computation techniques, focusing on cutting-edge developments in the field of information security.

• YouTube
• 1 hour 9 minutes
• On-Demand
• Conference Talk

TheIACR

Secure Computation II

Explore advanced secure computation concepts, including information theory, MPC, ground complexity, fairness, and breakthrough results in cryptography.

• YouTube
• 1 hour 17 minutes
• On-Demand
• Conference Talk

TheIACR

Secure Computation I

Explore secure multiparty computation protocols, their applications, and optimizations in this comprehensive overview of MPC fundamentals and advanced concepts.

• YouTube
• 1 hour 19 minutes
• On-Demand
• Conference Talk

TheIACR

Two Round Multiparty Secure Computation Minimizing Public Key Operations

Explore innovative techniques for efficient multiparty secure computation, focusing on minimizing public key operations in just two rounds of communication.

• YouTube
• 21 minutes
• On-Demand
• Conference Talk

TheIACR

Limits of Practical Sublinear Secure Computation

Explore theoretical boundaries of efficient secure computation, focusing on sublinear communication complexity and its practical implications in cryptography.

• YouTube
• 25 minutes
• On-Demand
• Conference Talk

TheIACR

Two-Round Multiparty Secure Computation from Minimal Assumptions

Explore minimal assumptions for two-round multiparty secure computation, covering protocol design, garbled circuits, and oblivious transfer in cryptographic applications.

• YouTube
• 25 minutes
• On-Demand
• Conference Talk

TheIACR

Overlaying Conditional Circuit Clauses for Secure Computation

Explore innovative techniques for enhancing secure computation through conditional circuit clause overlays, improving efficiency and functionality in cryptographic protocols.

• YouTube
• 31 minutes
• On-Demand
• Conference Talk

TheIACR

JIMU Faster LEGO Based Secure Computation Using Additive Homomorphic Hashes

Explore a novel secure computation technique using additive homomorphic hashes, enhancing LEGO-based protocols for improved efficiency and security in cryptographic applications.

• YouTube
• 24 minutes
• On-Demand
• Conference Talk

TheIACR

Unconditional UC Secure Computation with Stronger Malicious PUFs

Explore unconditional UC secure computation using stronger malicious PUFs, as presented at Eurocrypt 2017. Learn about advancements in cryptographic protocols and their implications.

• YouTube
• 23 minutes
• On-Demand
• Conference Talk

TheIACR

Group Based Secure Computation - Optimizing Rounds, Communication, and Computation

Explore optimizations for group-based secure computation, focusing on rounds, communication, and computation efficiency. Learn about homomorphic secret sharing and cryptographic frameworks.

• YouTube
• 26 minutes
• On-Demand
• Conference Talk

TheIACR

Breaking the Circuit Size Barrier for Secure Computation Under DDH

Explore secure computation techniques breaking circuit size barriers, including homomorphic encryption and secret sharing, with applications in branching programs and two-party computation.

• YouTube
• 27 minutes
• On-Demand
• Conference Talk