Learn · Secure Computation: Part II
Lecture 12 of 62Week 3
Randomized Protocol for Byzantine Agreement: Part I
Prof. Ashish Choudhury · IIITB
Credits and licence
- From
- Secure Computation: Part II, IIITB (at NPTEL)
- Licence
- CC BY-NC-SA, as NPTEL states it. Non-commercial use only.
- Attribution
- NPTEL states: "Distributed under Creative Commons Attribution-ShareAlike / CC BY - NC - SA", beside a BY-NC-SA badge. Coordinated by IISc Bangalore.
- Who can watch
- Tweens profiles and older. How courses are placed
All the lectures
- What is Secure Multi-Party Computation (MPC)?
- Reliable Broadcast and Byzantine Agreement
- EIG Protocol for Perfectly-Secure Byzantine Agreement
- EIG Protocol for Perfectly-Secure Byzantine Agreement: Illustration
- EIG Protocol for Perfectly-Secure Byzantine Agreement: Analysis Part I
- EIG Protocol for Perfectly-Secure Byzantine Agreement: Analysis Part II
- Efficient Protocols for Perfectly-Secure Byzantine Agreement: Part I
- Efficient Protocols for Perfectly-Secure Byzantine Agreement: Part II
- Domain Extension for Perfectly-Secure Byzantine Agreement
- Cryptographically/Statistically-Secure Reliable Broadcast
- Dolev-Strong Reliable Broadcast Protocol: Analysis
- Randomized Protocol for Byzantine Agreement: Part I
- Randomized Protocol for Byzantine Agreement: Part II
- Randomized Protocol for Byzantine Agreement: Part III
- Lower Bound for Number of Parties for Byzantine Agreement: Part I
- Lower Bound for Number of Parties for Byzantine Agreement: Part II
- Lower Bound for Number of Parties for Byzantine Agreement: Part III
- Recap of Basic Concepts from Abstract Algebra
- Reed-Solomon Error-Correcting Codes
- Perfectly-Secure Message Transmission
- Properties of Polynomials Over a Field: I
- Properties of Polynomials Over a Field: II
- One Round PSMT Protocol
- Multi-Round PSMT Protocol: I
- Multi-Round PSMT Protocol: II
- Domain Extension for Perfectly-Secure Broadcast Based on RS Error-Correcting Codes: I
- Domain Extension for Perfectly-Secure Broadcast Based on RS Error-Correcting Codes: II
- Domain Extension for Perfectly-Secure Broadcast Based on RS Error-Correcting Codes: III
- (n,t) – star Structure
- Domain Extension for Perfectly-Secure Broadcast Based on RS Error-Correcting Codes: IV
- The BGW MPC Protocol for Passive Corruptions : Recap
- The BGW MPC Protocol for Byzantine Corruptions: Challenges
- Perfectly-Secure VSS: Necessary Condition
- Bivariate Polynomials Over Finite Fields: I
- Bivariate Polynomials Over Finite Fields: II
- Bivariate Polynomials Over Finite Fields: III
- Bivariate Polynomials Over Finite Fields: IV
- Perfectly-Secure VSS with n greater than 3t : Part I
- Perfectly-Secure VSS with n greater than 3t : Part II
- Perfectly-Secure VSS with n greater than 3t: Part III
- Perfectly-Secure VSS with n greater than 3t: A Round-Reducing Technique
- Perfectly-Secure VSS with n greater than 4t: Part I
- Perfectly-Secure VSS with n greater than 4t: Part II
- The BGW MPC Protocol for Linear Functions
- The BGW MPC Protocol for Linear Functions: Security Analysis
- The BGW MPC Protocol: The Case of Non-Linear Gates
- The Degree-Reduction Problem
- Generating Random Multiplication-Triples: I
- Generating Random Multiplication-Triples: II
- Generating Random Multiplication-Triples: III
- Perfectly-Secure Protocol for Verifying Multiplicative Relationship
- Perfectly-Secure Verifiable Triple-Sharing Protocol
- Perfectly-Secure Triple-Extraction Protocol
- Towards Secure MPC with an Honest Majority
- ICP from Information-Theoretic MAC: I
- ICP from Information-Theoretic MAC: II
- Ingredients for Statistically-Secure MPC
- Statistically-Secure VSS
- Cyclic Groups and Discrete Logarithm
- Pedersen Commitment Scheme
- Cryptographically-secure VSS and MPC
- Goodbye and Farewell