Learn · Secure Computation: Part I
Lecture 60 of 63Live Session
Live Session 16-09-2021
Prof. Ashish Choudhury · IIITB
Credits and licence
- From
- Secure Computation: Part I, 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 MPC
- Real-World Examples of Secure MPC
- Various Dimensions to Study Secure MPC
- Recap of Basic Concepts from Abstract Algebra
- Recap of Basic Concepts from Abstract Algebra Contd.
- Recap of Basic Concepts from Cryptography
- Secret sharing
- Additive Secret Sharing
- Inefficient Threshold Secret Sharing
- Polynomials Over Fields
- Shamir Secret-Sharing
- Linear secret-sharing
- Linear Secret Sharing Contd.
- General Secret Sharing
- Perfectly-Secure Message Transmission
- A Toy MPC Protocol
- A Toy MPC Protocol Contd.
- A Toy MPC Protocol Contd.
- The BGW MPC Protocol
- 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
- The Gennaro-Rabin-Rabin (GRR) Degree-Reduction Method
- Analysis of the GRR, Degree-Reduction Method
- Shared Circuit-Evaluation via GRR Degree-Reduction Method
- Shared Circuit-Evaluation in the Pre-processing Model
- Optimality of Corruption Bound for Perfectly-Secure MPC
- Perfectly-Secure MPC Tolerating General (Non-Threshold) Adversaries
- Perfectly-Secure MPC Tolerating General (Non-Threshold) Adversaries with Q^((2)) Condition
- Perfectly-Secure MPC for Small Number of Parties
- Perfectly-Secure 3PC Contd.
- More Efficient Perfectly-Secure 3PC
- More Efficient Perfectly-Secure 3PC Contd.
- Towards Cryptographically-Secure MPC
- GMW MPC protocol
- Oblivious Transfer (OT)
- RSA Assumption and RSA Hard-Core Predicate
- Bit OT Based on RSA Assumption and Hard-Core Predicate
- Discrete Logarithm and DDH Assumption
- OT Based on the DDH Assumption
- Pre-Processing Phase for the GMW Protocol
- Pre-Processing Phase for the GMW Protocol: The n-Party Case
- Pre-Processing Phase for the GMW Protocol Contd.
- Pre-Processing of OT
- OT Extension
- Analysis of IKNP OT Extension
- Yao’s Protocol for Secure 2PC
- Yao’s Garbling Scheme
- Yao’s Protocol for Secure 2PC
- Optimizations for Yao’s Garbling
- Interpreting Yao’s Secure 2PC Protocol as a Secret-Sharing Based Protocol
- Mixed Protocols for Secure 2PC
- The Arithmetic, Boolean and Yao Sharing for Secure 2PC
- The ABY Conversions
- The ABY Conversions Contd.
- The ABY Conversions Contd.
- ABY Computations : Example
- Goodbye and Farewell
- Live Session 16-09-2021
- Live Session 06-03-2024
- Live Session 10-02-2025
- Live Session 24-03-2025