IIITB · Computer Science

Secure Computation: Part II

Prof. Ashish Choudhury · 2024 · 62 free video lectures

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…

▶ Play on Open Lecture HallCourse page ↗

Lectures

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

From NPTEL (IITs and IISc) · CC BY-NC-SA. More from IIITB.

Open Lecture Hall is free, with no ads and no sign-up. It is not run by or connected to any university; the lectures are the universities' own free recordings, played from where they host them. About & rights