Cryptography and Information Security Lab

Department of Computer Science and Automation

Cryptography and Information Security Lab

Department of Computer Science and Automation

CSA E0 312: Secure Computation (Jan - Apr 2026)

Instructor: Arpita Patra (Email: arpita AT iisc DOT ac DOT in)

Timings: 03:30 pm - 05:00 pm on Tuesday and Thursday.

Venue: CSA 254

Importance of the Course

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.

Course Syllabus

MPC Fundamentals: Introduction to MPC and simulation-based security model, Secret-Sharing, BGW protocol, OT, GMW protocol, Garbling and Yao’s protocol, Proofs.
MPC advanced: Agreement Protocols, Secure Graph Computation, Quantum MPC, Rational MPC, Communication Complexity of MPC, Round Complexity of MPC.

Study Material

[CP] Secure Multi-Party Computation Against Passive Adversaries by Ashish Choudhury and Arpita Patra. Springer.
[HL] Efficient Two-party Protocols- Techniques and Constructions by Carmit Hazay and Yehuda Lindell. Springer.
[CDN] Secure Multiparty Computation and Secret Sharing - An Information Theoretic Appoach by Ronald Cramer, Ivan Damgaard and Jesper Buus Nielsen. Cambridge Press.

Grading

Topics for Presentation I

1. Security Proof of BGW Protocol for Semi-Honest Case. Reference: [Paper].
1. Security Proof of Yao’s Protocol in OT Hybrid Model. Reference: [Paper].

Topics for Presentation II

Lecture Details

Lecture 1 : Introduction to MPC: Motivation and Definition, Protocol for Secure Sum
References: [Slides]
Date : 08-01-2026

Lecture 2 : MPC for Any Function, Secret Sharing, RSS, Maurer's Protocol
References: [Slides]
Date : 13-01-2026

Lecture 3 : Expanding the scope of MPC: Various Dimensions and Real/Ideal World Security Paradigm
References: [Slides]
Date : 14-01-2026

Lecture 4 : Security Proof for Sum Protocol and Maurer's Protocol, Real Ideal World Proof for Randomized Functionalities, Impossibility of 1 Round MPC
References: CP Book, [Paper]
Date : 20-01-2026

Lecture 5 : Secure Graph Computation
References: [Slides]
Date : 22-01-2026

Lecture 6 : RSS-based Secure Shuffle Protocol, 2 Round MPC for Single Input Functionalities
References: [Paper], [Paper]
Date : 27-01-2026

Lecture 7 : Impossibility of 2 Round Generic MPC Protocol
References: [Paper]
Date : 29-01-2026