X

Secure Computation: Part II

By Prof. Ashish Choudhury   |   IIIT Bangalore
Learners enrolled: 286
ABOUT THE COURSE:
Secure multi-party computation (MPC) is one of the most fundamental problems in cryptography as well as distributed computing. In a nutshell, a MPC protocol allows a set of mutually distrusting parties with private inputs, to perform any joint computation on their data, by keeping their respective data as private as possible. Secure MPC abstracts several real-world problems, for example privacy-preserving data mining, privacy-preserving ML, secure e-auctions, private matchmaking, secure set-intersection, secure e-voting, secure signal-processing, secure bioinformatics, secure biometrics, secure outsourcing, to name a few.
Since the domain of secure computation is enormously vast, it is impossible to discuss every relevant topic in just a single course. Hence the plan is to cover the topics in two parts. The first part titled Secure Computation: Part I has been already offered. In that course, we covered a simpler form of adversarial setting, namely semi-honest adversary (passive adversary), where the corrupt parties are supposed to follow protocol instructions. However, real-life attackers may not be so benign and can cause the compromised parties to behave in any arbitrary fashion. Such corruptions are better modelled by active/malicious (Byzantine) adversaries, which will be the focus of this course.

PREREQUISITES: It is expected that the participant has done a basic course on Cryptography (such as the Foundations of Cryptography course available on NPTEL), a basic course on Discrete Mathematics (several courses on Discrete Mathematics are available on NPTEL) and the course titled Secure Computation: Part I (available on NPTEL).
Summary
Course Status : Ongoing
Course Type : Elective
Duration : 12 weeks
Start Date : 25 Jul 2022
End Date : 14 Oct 2022
Exam Date : 29 Oct 2022 IST
Enrollment Ends : 08 Aug 2022
Category :
  • Computer Science and Engineering
Credit Points : 3
Level : Postgraduate

Page Visits



Course layout

Week 1:  Broadcast and Byzantine Agreement: definition, various protocols (deterministic, randomized, perfectly secure, cryptographically secure, statistically secure), various lower bounds
Week 2: Broadcast and Byzantine Agreement: definition, various protocols (deterministic, randomized, perfectly secure, cryptographically secure, statistically secure), various lower bounds (contd.)
Week 3: Broadcast and Byzantine Agreement: definition, various protocols (deterministic, randomized, perfectly secure, cryptographically secure, statistically secure), various lower bounds (contd.)
Week 4: Broadcast and Byzantine Agreement: definition, various protocols (deterministic, randomized, perfectly secure, cryptographically secure, statistically secure), various lower bounds (contd.)
Week 5: Reed-Solomon codes, perfectly secure message transmission protocols
Week 6: Verifiable Secret-Sharing (VSS): definition, various protocols (deterministic, randomized, perfectly secure, cryptographically secure, statistically secure), various lower bounds
Week 7: Verifiable Secret-Sharing (VSS): definition, various protocols (deterministic, randomized, perfectly secure, cryptographically secure, statistically secure), various lower bounds (contd.)
Week 8: Verifiable Secret-Sharing (VSS): definition, various protocols (deterministic, randomized, perfectly secure, cryptographically secure, statistically secure), various lower bounds (contd.)
Week 9: Classic protocols for actively-secure MPC: BenOr-Goldwasser-Wigderson (BGW), Rabin-BenOr (RB), detailed analysis
Week 10: Classic protocols for actively-secure MPC: BenOr-Goldwasser-Wigderson (BGW), Rabin-BenOr (RB), detailed analysis (contd.)
Week 11: State-of-the-art actively-secure protocols, player-elimination, actively-secure MPC for small number of parties and applications
Week 12: State-of-the-art actively-secure protocols, player-elimination, actively-secure MPC for small number of parties and applications (contd.)

Books and references

This is an advanced level research course where the contents are based on research papers. There is as such no single textbook which contains all the proposed topics. However, for few of the topics, the following textbooks can be used for the reference purpose:
  1. Efficient Two-party Protocols- Techniques and Constructions; by Carmit Hazay and Yehuda Lindell. Springer-Verlag, 2010.
  2. Engineering Secure Two-party Computation Protocols, by Thomas Schneider. Springer Verlag, 2010.
  3. Secure Multiparty Computation and Secret Sharing, by Ronald Cramer, Ivan Damgard and Jesper Buus Nielsen. Cambridge University Press, 2015.

Instructor bio

Prof. Ashish Choudhury

IIIT Bangalore
Dr. Ashish Choudhury is currently an Associate Professor at IIIT Bangalore. He did his MS and PhD in Computer science from IIT Madras, followed by postdoc at ISI Kolkata and University of Bristol. His research work is focused on the foundation of cryptographic protocols for real-world problems. His current projects aim to design efficient protocols in the asynchronous network model which can be realized in practice. In general he is interested in secure distributed computing and all areas of theoretical computer science.

Course certificate

The course is free to enroll and learn from. But if you want a certificate, you have to register and write the proctored exam conducted by us in person at any of the designated exam centres.
The exam is optional for a fee of Rs 1000/- (Rupees one thousand only).
Date and Time of Exams: 29 October 2022 Morning session 9am to 12 noon; Afternoon Session 2pm to 5pm.
Registration url: Announcements will be made when the registration form is open for registrations.
The online registration form has to be filled and the certification exam fee needs to be paid. More details will be made available when the exam registration form is published. If there are any changes, it will be mentioned then.
Please check the form for more details on the cities where the exams will be held, the conditions you agree to when you fill the form etc.

CRITERIA TO GET A CERTIFICATE

Average assignment score = 25% of average of best 8 assignments out of the total 12 assignments given in the course.
Exam score = 75% of the proctored certification exam score out of 100

Final score = Average assignment score + Exam score

YOU WILL BE ELIGIBLE FOR A CERTIFICATE ONLY IF AVERAGE ASSIGNMENT SCORE >=10/25 AND EXAM SCORE >= 30/75. If one of the 2 criteria is not met, you will not get the certificate even if the Final score >= 40/100.

Certificate will have your name, photograph and the score in the final exam with the breakup.It will have the logos of NPTEL and IISc Bangalore. It will be e-verifiable at nptel.ac.in/noc.

Only the e-certificate will be made available. Hard copies will not be dispatched.

Once again, thanks for your interest in our online courses and certification. Happy learning.

- NPTEL team


MHRD logo Swayam logo

DOWNLOAD APP

Goto google play store

FOLLOW US