Secure Multi-Party Computation (MPC) Course | Prof. Ashish Choudhury | IIIT Bangalore
Course Details
| Exam Registration | 141 |
|---|---|
| Course Status | Ongoing |
| Course Type | Elective |
| Language | English |
| Duration | 12 weeks |
| Categories | Computer Science and Engineering, Foundations of Computing, Cyber Security |
| Credit Points | 3 |
| Level | Undergraduate/Postgraduate |
| Start Date | 19 Jan 2026 |
| End Date | 10 Apr 2026 |
| Enrollment Ends | 02 Feb 2026 |
| Exam Registration Ends | 20 Feb 2026 |
| Exam Date | 17 Apr 2026 IST |
| NCrF Level | 4.5 — 8.0 |
Secure Computation: Part I - Unlocking Privacy in a Collaborative World
In an era defined by data, the ability to compute on sensitive information without compromising privacy is a paramount challenge. Welcome to Secure Computation: Part I, a comprehensive 12-week journey into the fascinating world of Secure Multi-Party Computation (MPC). This course, led by Prof. Ashish Choudhury of IIIT Bangalore, demystifies how cryptographic techniques enable mutually distrusting parties to jointly compute a function over their private inputs while revealing nothing beyond the output.
Meet Your Instructor: Prof. Ashish Choudhury
Dr. Ashish Choudhury is an Associate Professor at the International Institute of Information Technology Bangalore (IIIT Bangalore). With an MS and PhD from IIT Madras, followed by postdoctoral research at ISI Kolkata and the University of Bristol, Prof. Choudhury is a leading expert in the foundations of cryptographic protocols. His research is intensely focused on designing efficient, practical protocols, particularly for asynchronous networks. His work bridges the gap between theoretical distributed computing and real-world cybersecurity applications.
Why Secure Computation Matters: A Real-World Imperative
Consider a critical, modern-day scenario: preventing satellite collisions. Thousands of satellites and space debris orbit Earth, creating a tangible risk of catastrophic collisions. Predicting a collision requires precise orbital data from each satellite. However, this data is a closely guarded national secret for the host countries. The dilemma is clear: how can we determine an impending clash without any country disclosing its satellite's sensitive location?
This is precisely the problem Secure MPC solves. It provides a framework for privacy-preserving collaborative computation. Beyond space, MPC powers a vast array of applications:
- Secure E-Voting and E-Auctions
- Privacy-Preserving Data Mining and Machine Learning
- Secure Bioinformatics and Genomic Analysis
- Secure Biometric Authentication
- Secure Signal Processing and Cloud Outsourcing
MPC ensures that data can be useful without being exposed, making it a cornerstone of modern cybersecurity and data ethics.
Course Overview & Structure
This undergraduate/postgraduate level course is designed for students in Computer Science, Mathematics, and related fields. A foundational course in Cryptography and Discrete Mathematics is a prerequisite.
Duration: 12 Weeks
Level: Undergraduate/Postgraduate
Categories: Computer Science & Engineering, Foundations of Computing, Cyber Security
Detailed 12-Week Curriculum
The course is meticulously structured to build your understanding from the ground up.
| Week | Topics Covered |
|---|---|
| Week 1 | Motivation, real-world examples, abstract algebra review (groups, rings, fields), cryptographic foundations. |
| Week 2 | Secret Sharing: Motivation, definitions, Shamir, additive, and replicated secret-sharing schemes. |
| Week 3 | Linear & general secret-sharing, Secure Message Transmission (SMT). |
| Week 4 | In-depth analysis of the BenOr-Goldwasser-Wigderson (BGW) protocol and its security proof. |
| Week 5 | Degree-reduction problems, efficient multiplication gate protocols, MPC in the pre-processing model. |
| Week 6 | Perfectly-secure MPC for general adversaries and small party settings (e.g., secure 3-party computation). |
| Week 7 | Detailed study of the Goldreich-Micali-Wigderson (GMW) protocol and Oblivious Transfer (OT). |
| Week 8 | OT protocol constructions, GMW in the pre-processing model. |
| Week 9 | OT extension techniques and Yao's protocol for secure 2-party computation. |
| Week 10 | Optimizations and practical improvements for Yao's 2PC protocol. |
| Week 11 | Mixed-world MPC protocols for 2-party computation. |
| Week 12 | Advanced frameworks: Implementing mixed-world 2PC in the ABY framework. |
Primary Textbook & Resources
The course closely follows a seminal text co-authored by the instructor himself, ensuring perfect alignment between lectures and study material.
Book: Secure Multi-Party Computation Against Passive Adversaries by Ashish Choudhury and Arpita Patra (Synthesis Lectures on Distributed Computing Theory, 1st Edition, 2022).
This book offers detailed explanations, worked-out examples, and deep dives into every topic covered. Students are strongly encouraged to acquire a copy to supplement their learning.
- Purchase from Springer: https://link.springer.com/book/10.1007/978-3-031-12164-7
- Purchase from Amazon: https://www.amazon.com/Multi-Party-Computation-Adversaries-Synthesis-Distributed/dp/3031121635
Who Should Enroll?
This course is ideal for:
- Computer Science and Mathematics students interested in advanced cryptography.
- Researchers and professionals in cybersecurity, distributed systems, and data privacy.
- Anyone fascinated by the challenge of extracting value from data while staunchly defending individual privacy.
Secure Computation: Part I is more than a course; it's an entry point into the cutting-edge field that allows us to collaborate without compromise. Join Prof. Choudhury to build the foundational knowledge required to design and understand the privacy-preserving protocols of tomorrow.
Enroll Now →