Lec 19 The BGW MPC Protocol

preview_player
Показать описание
BGW protocol, Shared circuit-evaluation, perfect security, arithmetic circuits
  1. NPTEL - Indian Institute of Science, Bengaluru
  2. BGW protocol
  3. Shared circuit-evaluation
  4. perfect security
  5. arithmetic circuits
Рекомендации по теме
Lec 19 The 0:36:50

Lec 19 The BGW MPC Protocol

Lec 20 The 0:27:01

Lec 20 The BGW MPC Protocol for Linear Functions

Lec 44 The 0:18:01

Lec 44 The BGW MPC Protocol for Linear Functions

Lec 46 The 0:31:05

Lec 46 The BGW MPC Protocol: The Case of Non-Linear Gates

Lec 32 The 0:38:43

Lec 32 The BGW MPC Protocol for Byzantine Corruptions: Challenges

CompSci.202, Lec 15 1:22:16

CompSci.202, Lec 15 (2/23): MPC protocol of [BGW]

Lec 31 The 0:35:11

Lec 31 The BGW MPC Protocol for Passive Corruptions : Recap

Lec 22 The 0:40:23

Lec 22 The BGW MPC Protocol: The Case of Non-Linear Gates

CompSci.202, Lec 12 2:13:20

CompSci.202, Lec 12 (2/11): Multi-Party Computation (MPC), [GMW] protocol for (t,n)=(1,2) case

6.875 (Cryptography) L21: 1:23:48

6.875 (Cryptography) L21: BGW MPC, Malicious Adversaries

Lec 36 GMW 0:28:57

Lec 36 GMW MPC protocol

SPDZ: Malicious BGW 1:02:11

SPDZ: Malicious BGW MPC protocol - Week 3 MPC Study Group

Lec 01 What 0:28:16

Lec 01 What is Secure MPC

Lec 18 A 0:25:00

Lec 18 A Toy MPC Protocol Contd.

Secure Multi Party 1:00:00

Secure Multi Party Computation part 1- The BGW Protocol - Gilad Asharov

MPC-TP: MPC – 1:38:12

MPC-TP: MPC – a curtain raiser; and BGW - C Pandu Rangan

[BGW][Gilad Asharov]Lecture 5: 2:00:12

[BGW][Gilad Asharov]Lecture 5: Perfect Secure Computation: Past and Present

MPC Protocol 0:01:56

MPC Protocol

Generalizing the SPDZ 0:17:27

Generalizing the SPDZ Compiler For Other Protocols

Ligero: Sublinear Arguments 1:00:46

Ligero: Sublinear Arguments from MPC-in-the-head

Lec 29 Perfectly-Secure 0:41:02

Lec 29 Perfectly-Secure MPC Tolerating General (Non-Threshold) Adversaries

MPC-TP: Probabilistic Termination 0:58:51

MPC-TP: Probabilistic Termination and Composability of Cryptographic Protocols - Juan A Garay

Private Set Intersection 0:59:18

Private Set Intersection – Malicious Security, and Probability Amplification - Benny Pinkas

The Round Complexity 0:26:03

The Round Complexity of Perfect MPC with Active Security and Optimal Resiliency

Комментарии
Автор

This is the best explanation I've seen on this topic so far. Such a wonderful lecture.
Thank you.

blessdarah
Автор

Sir, The lecture’s good. But I have to ask you what you mean by deterministic function?…if function is viewed as an algorithm then it always is “deterministic“ right? Because of well definedneess of the map(a map that’s well defined is a function) like the statement would be “Consider a set theoretic map f. f is well defined if and only if it’s a deterministic algorithm”. Or is it that I’m getting something wrong?

s.dheerajkumar