| Sl.No | Chapter Name | MP4 Download |
|---|---|---|
| 1 | Lec 01 What is Secure Multi-Party Computation (MPC)? | Download |
| 2 | Lec 02 Reliable Broadcast and Byzantine Agreement | Download |
| 3 | lec 03 EIG Protocol for Perfectly-Secure Byzantine Agreement | Download |
| 4 | Lec 04 EIG Protocol for Perfectly-Secure Byzantine Agreement: Illustration | Download |
| 5 | Lec 05 EIG Protocol for Perfectly-Secure Byzantine Agreement: Analysis Part I | Download |
| 6 | Lec 06 EIG Protocol for Perfectly-Secure Byzantine Agreement: Analysis Part II | Download |
| 7 | Lec 07 Efficient Protocols for Perfectly-Secure Byzantine Agreement: Part I | Download |
| 8 | Lec 08 Efficient Protocols for Perfectly-Secure Byzantine Agreement: Part II | Download |
| 9 | Lec 09 Domain Extension for Perfectly-Secure Byzantine Agreement | Download |
| 10 | Lec 10 Cryptographically/Statistically-Secure Reliable Broadcast | Download |
| 11 | Lec 11 Dolev-Strong Reliable Broadcast Protocol: Analysis | Download |
| 12 | Lec 12 Randomized Protocol for Byzantine Agreement: Part I | Download |
| 13 | Lec 13 Randomized Protocol for Byzantine Agreement: Part II | Download |
| 14 | Lec 14 Randomized Protocol for Byzantine Agreement: Part III | Download |
| 15 | lec 15 Lower Bound for Number of Parties for Byzantine Agreement: Part I | Download |
| 16 | Lec 16 Lower Bound for Number of Parties for Byzantine Agreement: Part II | Download |
| 17 | Lec 17 Lower Bound for Number of Parties for Byzantine Agreement: Part III | Download |
| 18 | Lec 18 Recap of Basic Concepts from Abstract Algebra | Download |
| 19 | lec 19 Reed-Solomon Error-Correcting Codes | Download |
| 20 | Lec 20 Perfectly-Secure Message Transmission | Download |
| 21 | Lec 21 Properties of Polynomials Over a Field: I | Download |
| 22 | Lec 22 Properties of Polynomials Over a Field: II | Download |
| 23 | Lec 23 One Round PSMT Protocol | Download |
| 24 | Lec 24 Multi-Round PSMT Protocol: I | Download |
| 25 | Lec 25 Multi-Round PSMT Protocol: II | Download |
| 26 | Lec 26 Domain Extension for Perfectly-Secure Broadcast Based on RS Error-Correcting Codes: I | Download |
| 27 | Lec 27 Domain Extension for Perfectly-Secure Broadcast Based on RS Error-Correcting Codes: II | Download |
| 28 | Lec 28 Domain Extension for Perfectly-Secure Broadcast Based on RS Error-Correcting Codes: III | Download |
| 29 | Lec 29 (n,t) – star Structure | Download |
| 30 | Lec 30 Domain Extension for Perfectly-Secure Broadcast Based on RS Error-Correcting Codes: IV | Download |
| 31 | Lec 31 The BGW MPC Protocol for Passive Corruptions : Recap | Download |
| 32 | Lec 32 The BGW MPC Protocol for Byzantine Corruptions: Challenges | Download |
| 33 | Lec 33 Perfectly-Secure VSS: Necessary Condition | Download |
| 34 | Lec 34 Bivariate Polynomials Over Finite Fields: I | Download |
| 35 | Lec 35 Bivariate Polynomials Over Finite Fields: II | Download |
| 36 | Lec 36 Bivariate Polynomials Over Finite Fields: III | Download |
| 37 | Lec 37 Bivariate Polynomials Over Finite Fields: IV | Download |
| 38 | Lec 38 Perfectly-Secure VSS with n greater than 3t : Part I | Download |
| 39 | Lec 39 Perfectly-Secure VSS with n greater than 3t : Part II | Download |
| 40 | Lec 40 Perfectly-Secure VSS with n greater than 3t: Part III | Download |
| 41 | Lec 41 Perfectly-Secure VSS with n greater than 3t: A Round-Reducing Technique | Download |
| 42 | Lec 42 Perfectly-Secure VSS with n greater than 4t: Part I | Download |
| 43 | Lec 43 Perfectly-Secure VSS with n greater than 4t: Part II | Download |
| 44 | Download | |
| 45 | Lec 45 The BGW MPC Protocol for Linear Functions: Security Analysis | Download |
| 46 | Lec 46 The BGW MPC Protocol: The Case of Non-Linear Gates | Download |
| 47 | Lec 47 The Degree-Reduction Problem | Download |
| 48 | Lec 48 Generating Random Multiplication-Triples: I | Download |
| 49 | Lec 49 Generating Random Multiplication-Triples: II | Download |
| 50 | Download | |
| 51 | Lec 51 Perfectly-Secure Protocol for Verifying Multiplicative Relationship | Download |
| 52 | Lec 52 Perfectly-Secure Verifiable Triple-Sharing Protocol | Download |
| 53 | Lec 53 Perfectly-Secure Triple-Extraction Protocol | Download |
| 54 | Lec 54 Towards Secure MPC with an Honest Majority | Download |
| 55 | Lec 55 ICP from Information-Theoretic MAC: I | Download |
| 56 | Lec 56 ICP from Information-Theoretic MAC: II | Download |
| 57 | Lec 57 Ingredients for Statistically-Secure MPC | Download |
| 58 | Lec 58 Statistically-Secure VSS | Download |
| 59 | Lec 59 Cyclic Groups and Discrete Logarithm | Download |
| 60 | Lec 60 Pedersen Commitment Scheme | Download |
| 61 | Download | |
| 62 | Lec 62 Goodbye and Farewell | Download |
| Sl.No | Chapter Name | English |
|---|---|---|
| 1 | Lec 01 What is Secure Multi-Party Computation (MPC)? | Download Verified |
| 2 | Lec 02 Reliable Broadcast and Byzantine Agreement | Download Verified |
| 3 | lec 03 EIG Protocol for Perfectly-Secure Byzantine Agreement | Download Verified |
| 4 | Lec 04 EIG Protocol for Perfectly-Secure Byzantine Agreement: Illustration | Download Verified |
| 5 | Lec 05 EIG Protocol for Perfectly-Secure Byzantine Agreement: Analysis Part I | Download Verified |
| 6 | Lec 06 EIG Protocol for Perfectly-Secure Byzantine Agreement: Analysis Part II | Download Verified |
| 7 | Lec 07 Efficient Protocols for Perfectly-Secure Byzantine Agreement: Part I | Download Verified |
| 8 | Lec 08 Efficient Protocols for Perfectly-Secure Byzantine Agreement: Part II | Download Verified |
| 9 | Lec 09 Domain Extension for Perfectly-Secure Byzantine Agreement | Download Verified |
| 10 | Lec 10 Cryptographically/Statistically-Secure Reliable Broadcast | Download Verified |
| 11 | Lec 11 Dolev-Strong Reliable Broadcast Protocol: Analysis | Download Verified |
| 12 | Lec 12 Randomized Protocol for Byzantine Agreement: Part I | Download Verified |
| 13 | Lec 13 Randomized Protocol for Byzantine Agreement: Part II | Download Verified |
| 14 | Lec 14 Randomized Protocol for Byzantine Agreement: Part III | Download Verified |
| 15 | lec 15 Lower Bound for Number of Parties for Byzantine Agreement: Part I | PDF unavailable |
| 16 | Lec 16 Lower Bound for Number of Parties for Byzantine Agreement: Part II | PDF unavailable |
| 17 | Lec 17 Lower Bound for Number of Parties for Byzantine Agreement: Part III | PDF unavailable |
| 18 | Lec 18 Recap of Basic Concepts from Abstract Algebra | Download Verified |
| 19 | lec 19 Reed-Solomon Error-Correcting Codes | PDF unavailable |
| 20 | Lec 20 Perfectly-Secure Message Transmission | Download Verified |
| 21 | Lec 21 Properties of Polynomials Over a Field: I | PDF unavailable |
| 22 | Lec 22 Properties of Polynomials Over a Field: II | Download Verified |
| 23 | Lec 23 One Round PSMT Protocol | PDF unavailable |
| 24 | Lec 24 Multi-Round PSMT Protocol: I | Download Verified |
| 25 | Lec 25 Multi-Round PSMT Protocol: II | PDF unavailable |
| 26 | Lec 26 Domain Extension for Perfectly-Secure Broadcast Based on RS Error-Correcting Codes: I | PDF unavailable |
| 27 | Lec 27 Domain Extension for Perfectly-Secure Broadcast Based on RS Error-Correcting Codes: II | PDF unavailable |
| 28 | Lec 28 Domain Extension for Perfectly-Secure Broadcast Based on RS Error-Correcting Codes: III | PDF unavailable |
| 29 | Lec 29 (n,t) – star Structure | PDF unavailable |
| 30 | Lec 30 Domain Extension for Perfectly-Secure Broadcast Based on RS Error-Correcting Codes: IV | PDF unavailable |
| 31 | Lec 31 The BGW MPC Protocol for Passive Corruptions : Recap | PDF unavailable |
| 32 | Lec 32 The BGW MPC Protocol for Byzantine Corruptions: Challenges | PDF unavailable |
| 33 | Lec 33 Perfectly-Secure VSS: Necessary Condition | PDF unavailable |
| 34 | Lec 34 Bivariate Polynomials Over Finite Fields: I | PDF unavailable |
| 35 | Lec 35 Bivariate Polynomials Over Finite Fields: II | PDF unavailable |
| 36 | Lec 36 Bivariate Polynomials Over Finite Fields: III | PDF unavailable |
| 37 | Lec 37 Bivariate Polynomials Over Finite Fields: IV | PDF unavailable |
| 38 | Lec 38 Perfectly-Secure VSS with n greater than 3t : Part I | PDF unavailable |
| 39 | Lec 39 Perfectly-Secure VSS with n greater than 3t : Part II | PDF unavailable |
| 40 | Lec 40 Perfectly-Secure VSS with n greater than 3t: Part III | PDF unavailable |
| 41 | Lec 41 Perfectly-Secure VSS with n greater than 3t: A Round-Reducing Technique | PDF unavailable |
| 42 | Lec 42 Perfectly-Secure VSS with n greater than 4t: Part I | PDF unavailable |
| 43 | Lec 43 Perfectly-Secure VSS with n greater than 4t: Part II | PDF unavailable |
| 44 | PDF unavailable | |
| 45 | Lec 45 The BGW MPC Protocol for Linear Functions: Security Analysis | PDF unavailable |
| 46 | Lec 46 The BGW MPC Protocol: The Case of Non-Linear Gates | PDF unavailable |
| 47 | Lec 47 The Degree-Reduction Problem | PDF unavailable |
| 48 | Lec 48 Generating Random Multiplication-Triples: I | PDF unavailable |
| 49 | Lec 49 Generating Random Multiplication-Triples: II | PDF unavailable |
| 50 | PDF unavailable | |
| 51 | Lec 51 Perfectly-Secure Protocol for Verifying Multiplicative Relationship | PDF unavailable |
| 52 | Lec 52 Perfectly-Secure Verifiable Triple-Sharing Protocol | PDF unavailable |
| 53 | Lec 53 Perfectly-Secure Triple-Extraction Protocol | PDF unavailable |
| 54 | Lec 54 Towards Secure MPC with an Honest Majority | PDF unavailable |
| 55 | Lec 55 ICP from Information-Theoretic MAC: I | PDF unavailable |
| 56 | Lec 56 ICP from Information-Theoretic MAC: II | PDF unavailable |
| 57 | Lec 57 Ingredients for Statistically-Secure MPC | PDF unavailable |
| 58 | Lec 58 Statistically-Secure VSS | PDF unavailable |
| 59 | Lec 59 Cyclic Groups and Discrete Logarithm | PDF unavailable |
| 60 | Lec 60 Pedersen Commitment Scheme | PDF unavailable |
| 61 | PDF unavailable | |
| 62 | Lec 62 Goodbye and Farewell | PDF unavailable |
| Sl.No | Language | Book link |
|---|---|---|
| 1 | English | Not Available |
| 2 | Bengali | Not Available |
| 3 | Gujarati | Not Available |
| 4 | Hindi | Not Available |
| 5 | Kannada | Not Available |
| 6 | Malayalam | Not Available |
| 7 | Marathi | Not Available |
| 8 | Tamil | Not Available |
| 9 | Telugu | Not Available |