- Arpita Patra (Email: arpita AT csa )
The fantabulous journey of Secure Computation had originated with the seminal work of Andew Chi Chih Yao published in Foundation of Computer Science (FOCS'82). The idea of secure computation is so groundbreaking that Yao was bestowed with the prestigious Turing Award in 2000. It feels wonderful to offer a course that is first of its kind in India. For more details, follow this link
Models of Secure Computation: Honest vs. Dishonest majority settings, semi-honest vs active(malicious) adversary, static vs. adaptive computation, computational vs. information theoretic security, synchronous vs. asynchronous network. Introduction to various primitives.
Defining Secure Computation: Computational/statistical Indistinguishability, Real-Ideal World or Simulation-based Security notions.
Secure computation with semi-honest security: Secret Sharing Schemes, Oblivious Transfers (OT) and Extensions, Circuit Garbling, BenOr-Goldwasser-Wigderson (BGW) Construction, Goldreich-Micali-Wigderson (GMW) construction, Yao construction, BMR construction.
Secure computation with Active security: Verifiable Secret Sharing, Commitment Schemes, Zero-knowledge Protocols, BGW Construction with active security, GMW Compiler for active corruption, More Efficienct Constructions.
Lecture 1: Introduction. Slides [ppt]
Lecture 2: Expanding the scope of MPC. Various network Models. Slides [ppt]
Lecture 3: Expanding the scope of MPC. Various adversary Models. Slides [ppt]
Lecture 4: Defining Security. Real/Ideal World Security Paradigm. Slides [ppt]
Lecture 5: Defining Security. Distinguishing between deterministic and randomized functions in the Real/Ideal World Security Paradigm. Slides [ppt]
Lecture 6: Impossibility of (a) i.t. MPC with t > n/2 and (b) asynchronous perfect MPC with t > n/4. Slides [ppt]
Lecture 7: BGW I. Slides [ppt]
Lecture 8: BGW II. Slides [ppt]
Lecture 9: Circuit Garbling, Yao I. Slides [ppt]
Lecture 10: Circuit Garbling, Yao II. Slides [ppt]
Lecture 11: GMW I. Slides [ppt]