Modules / Lectures


Sl.No Chapter Name MP4 Download
1Lec 01 What is Secure Multi-Party Computation (MPC)?Download
2Lec 02 Reliable Broadcast and Byzantine AgreementDownload
3lec 03 EIG Protocol for Perfectly-Secure Byzantine AgreementDownload
4Lec 04 EIG Protocol for Perfectly-Secure Byzantine Agreement: IllustrationDownload
5Lec 05 EIG Protocol for Perfectly-Secure Byzantine Agreement: Analysis Part IDownload
6Lec 06 EIG Protocol for Perfectly-Secure Byzantine Agreement: Analysis Part IIDownload
7Lec 07 Efficient Protocols for Perfectly-Secure Byzantine Agreement: Part IDownload
8Lec 08 Efficient Protocols for Perfectly-Secure Byzantine Agreement: Part IIDownload
9Lec 09 Domain Extension for Perfectly-Secure Byzantine AgreementDownload
10Lec 10 Cryptographically/Statistically-Secure Reliable BroadcastDownload
11Lec 11 Dolev-Strong Reliable Broadcast Protocol: AnalysisDownload
12Lec 12 Randomized Protocol for Byzantine Agreement: Part IDownload
13Lec 13 Randomized Protocol for Byzantine Agreement: Part IIDownload
14Lec 14 Randomized Protocol for Byzantine Agreement: Part IIIDownload
15lec 15 Lower Bound for Number of Parties for Byzantine Agreement: Part IDownload
16Lec 16 Lower Bound for Number of Parties for Byzantine Agreement: Part IIDownload
17Lec 17 Lower Bound for Number of Parties for Byzantine Agreement: Part IIIDownload
18Lec 18 Recap of Basic Concepts from Abstract AlgebraDownload
19lec 19 Reed-Solomon Error-Correcting CodesDownload
20Lec 20 Perfectly-Secure Message TransmissionDownload
21Lec 21 Properties of Polynomials Over a Field: IDownload
22Lec 22 Properties of Polynomials Over a Field: IIDownload
23Lec 23 One Round PSMT ProtocolDownload
24Lec 24 Multi-Round PSMT Protocol: IDownload
25Lec 25 Multi-Round PSMT Protocol: IIDownload
26Lec 26 Domain Extension for Perfectly-Secure Broadcast Based on RS Error-Correcting Codes: IDownload
27Lec 27 Domain Extension for Perfectly-Secure Broadcast Based on RS Error-Correcting Codes: IIDownload
28Lec 28 Domain Extension for Perfectly-Secure Broadcast Based on RS Error-Correcting Codes: IIIDownload
29Lec 29 (n,t) – star StructureDownload
30Lec 30 Domain Extension for Perfectly-Secure Broadcast Based on RS Error-Correcting Codes: IVDownload
31Lec 31 The BGW MPC Protocol for Passive Corruptions : RecapDownload
32Lec 32 The BGW MPC Protocol for Byzantine Corruptions: ChallengesDownload
33Lec 33 Perfectly-Secure VSS: Necessary ConditionDownload
34Lec 34 Bivariate Polynomials Over Finite Fields: IDownload
35Lec 35 Bivariate Polynomials Over Finite Fields: IIDownload
36Lec 36 Bivariate Polynomials Over Finite Fields: IIIDownload
37Lec 37 Bivariate Polynomials Over Finite Fields: IVDownload
38Lec 38 Perfectly-Secure VSS with n greater than 3t : Part IDownload
39Lec 39 Perfectly-Secure VSS with n greater than 3t : Part IIDownload
40Lec 40 Perfectly-Secure VSS with n greater than 3t: Part IIIDownload
41Lec 41 Perfectly-Secure VSS with n greater than 3t: A Round-Reducing TechniqueDownload
42Lec 42 Perfectly-Secure VSS with n greater than 4t: Part IDownload
43Lec 43 Perfectly-Secure VSS with n greater than 4t: Part IIDownload
44Download
45Lec 45 The BGW MPC Protocol for Linear Functions: Security AnalysisDownload
46Lec 46 The BGW MPC Protocol: The Case of Non-Linear GatesDownload
47Lec 47 The Degree-Reduction ProblemDownload
48Lec 48 Generating Random Multiplication-Triples: IDownload
49Lec 49 Generating Random Multiplication-Triples: IIDownload
50Download

Sl.No Chapter Name English
1Lec 01 What is Secure Multi-Party Computation (MPC)?Download
Verified
2Lec 02 Reliable Broadcast and Byzantine AgreementDownload
Verified
3lec 03 EIG Protocol for Perfectly-Secure Byzantine AgreementDownload
Verified
4Lec 04 EIG Protocol for Perfectly-Secure Byzantine Agreement: IllustrationDownload
Verified
5Lec 05 EIG Protocol for Perfectly-Secure Byzantine Agreement: Analysis Part IDownload
Verified
6Lec 06 EIG Protocol for Perfectly-Secure Byzantine Agreement: Analysis Part IIPDF unavailable
7Lec 07 Efficient Protocols for Perfectly-Secure Byzantine Agreement: Part IDownload
Verified
8Lec 08 Efficient Protocols for Perfectly-Secure Byzantine Agreement: Part IIPDF unavailable
9Lec 09 Domain Extension for Perfectly-Secure Byzantine AgreementDownload
Verified
10Lec 10 Cryptographically/Statistically-Secure Reliable BroadcastPDF unavailable
11Lec 11 Dolev-Strong Reliable Broadcast Protocol: AnalysisDownload
Verified
12Lec 12 Randomized Protocol for Byzantine Agreement: Part IPDF unavailable
13Lec 13 Randomized Protocol for Byzantine Agreement: Part IIDownload
Verified
14Lec 14 Randomized Protocol for Byzantine Agreement: Part IIIPDF unavailable
15lec 15 Lower Bound for Number of Parties for Byzantine Agreement: Part IPDF unavailable
16Lec 16 Lower Bound for Number of Parties for Byzantine Agreement: Part IIPDF unavailable
17Lec 17 Lower Bound for Number of Parties for Byzantine Agreement: Part IIIPDF unavailable
18Lec 18 Recap of Basic Concepts from Abstract AlgebraPDF unavailable
19lec 19 Reed-Solomon Error-Correcting CodesPDF unavailable
20Lec 20 Perfectly-Secure Message TransmissionPDF unavailable
21Lec 21 Properties of Polynomials Over a Field: IPDF unavailable
22Lec 22 Properties of Polynomials Over a Field: IIPDF unavailable
23Lec 23 One Round PSMT ProtocolPDF unavailable
24Lec 24 Multi-Round PSMT Protocol: IPDF unavailable
25Lec 25 Multi-Round PSMT Protocol: IIPDF unavailable
26Lec 26 Domain Extension for Perfectly-Secure Broadcast Based on RS Error-Correcting Codes: IPDF unavailable
27Lec 27 Domain Extension for Perfectly-Secure Broadcast Based on RS Error-Correcting Codes: IIPDF unavailable
28Lec 28 Domain Extension for Perfectly-Secure Broadcast Based on RS Error-Correcting Codes: IIIPDF unavailable
29Lec 29 (n,t) – star StructurePDF unavailable
30Lec 30 Domain Extension for Perfectly-Secure Broadcast Based on RS Error-Correcting Codes: IVPDF unavailable
31Lec 31 The BGW MPC Protocol for Passive Corruptions : RecapPDF unavailable
32Lec 32 The BGW MPC Protocol for Byzantine Corruptions: ChallengesPDF unavailable
33Lec 33 Perfectly-Secure VSS: Necessary ConditionPDF unavailable
34Lec 34 Bivariate Polynomials Over Finite Fields: IPDF unavailable
35Lec 35 Bivariate Polynomials Over Finite Fields: IIPDF unavailable
36Lec 36 Bivariate Polynomials Over Finite Fields: IIIPDF unavailable
37Lec 37 Bivariate Polynomials Over Finite Fields: IVPDF unavailable
38Lec 38 Perfectly-Secure VSS with n greater than 3t : Part IPDF unavailable
39Lec 39 Perfectly-Secure VSS with n greater than 3t : Part IIPDF unavailable
40Lec 40 Perfectly-Secure VSS with n greater than 3t: Part IIIPDF unavailable
41Lec 41 Perfectly-Secure VSS with n greater than 3t: A Round-Reducing TechniquePDF unavailable
42Lec 42 Perfectly-Secure VSS with n greater than 4t: Part IPDF unavailable
43Lec 43 Perfectly-Secure VSS with n greater than 4t: Part IIPDF unavailable
44PDF unavailable
45Lec 45 The BGW MPC Protocol for Linear Functions: Security AnalysisPDF unavailable
46Lec 46 The BGW MPC Protocol: The Case of Non-Linear GatesPDF unavailable
47Lec 47 The Degree-Reduction ProblemPDF unavailable
48Lec 48 Generating Random Multiplication-Triples: IPDF unavailable
49Lec 49 Generating Random Multiplication-Triples: IIPDF unavailable
50PDF unavailable


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