Modules / Lectures


Sl.No Chapter Name MP4 Download
1Lec 01 What is Secure MPCDownload
2Lec 02 Real-World Examples of Secure MPCDownload
3Lec 03 Various Dimensions to Study Secure MPCDownload
4Lec 04 Recap of Basic Concepts from Abstract AlgebraDownload
5Lec 05 Recap of Basic Concepts from Abstract Algebra Contd.Download
6Lec 06 Recap of Basic Concepts from CryptographyDownload
7Lec 07 Secret sharingDownload
8Lec 08 Additive Secret SharingDownload
9Lec 09 Inefficient Threshold Secret SharingDownload
10Lec 10 Polynomials Over FieldsDownload
11Lec 11 Shamir Secret-SharingDownload
12Lec 12 Linear secret-sharingDownload
13Lec 13 Linear Secret Sharing Contd.Download
14Lec 14 General Secret SharingDownload
15Lec 15 Perfectly-Secure Message TransmissionDownload
16Lec 16 A Toy MPC ProtocolDownload
17Lec 17 A Toy MPC Protocol Contd.Download
18Lec 18 A Toy MPC Protocol Contd.Download
19Lec 19 The BGW MPC ProtocolDownload
20Lec 20 The BGW MPC Protocol for Linear FunctionsDownload
21Lec 21 The BGW MPC Protocol for Linear Functions: Security AnalysisDownload
22Lec 22 The BGW MPC Protocol: The Case of Non-Linear GatesDownload
23Lec 23 The Degree-Reduction ProblemDownload
24Lec 24 The Gennaro-Rabin-Rabin (GRR) Degree-Reduction MethodDownload
25Lec 25 Analysis of the GRR, Degree-Reduction MethodDownload
26Lec 26 Shared Circuit-Evaluation via GRR Degree-Reduction MethodDownload
27Lec 27 Shared Circuit-Evaluation in the Pre-processing ModelDownload
28Lec 28 Optimality of Corruption Bound for Perfectly-Secure MPCDownload
29Lec 29 Perfectly-Secure MPC Tolerating General (Non-Threshold) AdversariesDownload
30Lec 30 Perfectly-Secure MPC Tolerating General (Non-Threshold) Adversaries with Q^((2)) ConditionDownload
31Lec 31 Perfectly-Secure MPC for Small Number of PartiesDownload
32Lec 32 Perfectly-Secure 3PC Contd.Download
33Lec 33 More Efficient Perfectly-Secure 3PCDownload
34Lec 34 More Efficient Perfectly-Secure 3PC Contd.Download
35Lec 35 Towards Cryptographically-Secure MPCDownload
36Lec 36 GMW MPC protocolDownload
37Lec 37 Oblivious Transfer (OT)Download
38Lec 38 RSA Assumption and RSA Hard-Core PredicateDownload
39Lec 39 Bit OT Based on RSA Assumption and Hard-Core PredicateDownload
40Lec 40 Discrete Logarithm and DDH AssumptionDownload
41Lec 41 OT Based on the DDH AssumptionDownload
42Lec 42 Pre-Processing Phase for the GMW ProtocolDownload
43Lec 43 Pre-Processing Phase for the GMW Protocol: The n-Party CaseDownload
44Lec 44 Pre-Processing Phase for the GMW Protocol Contd.Download

Sl.No Chapter Name English
1Lec 01 What is Secure MPCPDF unavailable
2Lec 02 Real-World Examples of Secure MPCPDF unavailable
3Lec 03 Various Dimensions to Study Secure MPCPDF unavailable
4Lec 04 Recap of Basic Concepts from Abstract AlgebraPDF unavailable
5Lec 05 Recap of Basic Concepts from Abstract Algebra Contd.PDF unavailable
6Lec 06 Recap of Basic Concepts from CryptographyPDF unavailable
7Lec 07 Secret sharingPDF unavailable
8Lec 08 Additive Secret SharingPDF unavailable
9Lec 09 Inefficient Threshold Secret SharingPDF unavailable
10Lec 10 Polynomials Over FieldsPDF unavailable
11Lec 11 Shamir Secret-SharingPDF unavailable
12Lec 12 Linear secret-sharingPDF unavailable
13Lec 13 Linear Secret Sharing Contd.PDF unavailable
14Lec 14 General Secret SharingPDF unavailable
15Lec 15 Perfectly-Secure Message TransmissionPDF unavailable
16Lec 16 A Toy MPC ProtocolPDF unavailable
17Lec 17 A Toy MPC Protocol Contd.PDF unavailable
18Lec 18 A Toy MPC Protocol Contd.PDF unavailable
19Lec 19 The BGW MPC ProtocolPDF unavailable
20Lec 20 The BGW MPC Protocol for Linear FunctionsPDF unavailable
21Lec 21 The BGW MPC Protocol for Linear Functions: Security AnalysisPDF unavailable
22Lec 22 The BGW MPC Protocol: The Case of Non-Linear GatesPDF unavailable
23Lec 23 The Degree-Reduction ProblemPDF unavailable
24Lec 24 The Gennaro-Rabin-Rabin (GRR) Degree-Reduction MethodPDF unavailable
25Lec 25 Analysis of the GRR, Degree-Reduction MethodPDF unavailable
26Lec 26 Shared Circuit-Evaluation via GRR Degree-Reduction MethodPDF unavailable
27Lec 27 Shared Circuit-Evaluation in the Pre-processing ModelPDF unavailable
28Lec 28 Optimality of Corruption Bound for Perfectly-Secure MPCPDF unavailable
29Lec 29 Perfectly-Secure MPC Tolerating General (Non-Threshold) AdversariesPDF unavailable
30Lec 30 Perfectly-Secure MPC Tolerating General (Non-Threshold) Adversaries with Q^((2)) ConditionPDF unavailable
31Lec 31 Perfectly-Secure MPC for Small Number of PartiesPDF unavailable
32Lec 32 Perfectly-Secure 3PC Contd.PDF unavailable
33Lec 33 More Efficient Perfectly-Secure 3PCPDF unavailable
34Lec 34 More Efficient Perfectly-Secure 3PC Contd.PDF unavailable
35Lec 35 Towards Cryptographically-Secure MPCPDF unavailable
36Lec 36 GMW MPC protocolPDF unavailable
37Lec 37 Oblivious Transfer (OT)PDF unavailable
38Lec 38 RSA Assumption and RSA Hard-Core PredicatePDF unavailable
39Lec 39 Bit OT Based on RSA Assumption and Hard-Core PredicatePDF unavailable
40Lec 40 Discrete Logarithm and DDH AssumptionPDF unavailable
41Lec 41 OT Based on the DDH AssumptionPDF unavailable
42Lec 42 Pre-Processing Phase for the GMW ProtocolPDF unavailable
43Lec 43 Pre-Processing Phase for the GMW Protocol: The n-Party CasePDF unavailable
44Lec 44 Pre-Processing Phase for the GMW Protocol Contd.PDF unavailable


Sl.No Language Book link
1EnglishNot Available
2BengaliNot Available
3GujaratiNot Available
4HindiNot Available
5KannadaNot Available
6MalayalamNot Available
7MarathiNot Available
8TamilNot Available
9TeluguNot Available