Lower Bounds for Information-Theoretic MPC

preview_player
Показать описание
Ivan Damgård, Aarhus University
Securing Computation
  1. Simons Institute
  2. Simons Institute
  3. UC Berkeley
  4. computer science
  5. theory of computing
  6. Cryptography
Рекомендации по теме
Lower Bounds for 0:30:10

Lower Bounds for Information-Theoretic MPC

2021 ITC Conference: 0:22:24

2021 ITC Conference: More Communication Lower Bounds for Information-Theoretic MPC

Communication Lower Bounds 0:25:23

Communication Lower Bounds for Perfect Maliciously Secure MPC

Amortized Complexity of 0:24:53

Amortized Complexity of Information Theoretically Secure MPC Revisted

Keynote: Gage MPC 0:57:05

Keynote: Gage MPC – Going beyond the Residual Function Non-Interactive MPC Lower Bound - Tal Rabin

Functional Encryption: New 0:16:53

Functional Encryption: New Perspectives and Lower Bounds

Information Theoretic MPC: 0:40:48

Information Theoretic MPC: Techniques That Age Well

Must the Communication 0:19:56

Must the Communication Graph of MPC Protocols be an Expander

The Round Complexity 0:26:03

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

Jonathan Ullman: The 1:04:10

Jonathan Ullman: The Limits of Pan Privacy and Shuffle Privacy for Learning and Estimation

The Communication Complexity 0:55:51

The Communication Complexity Landscape of Information-theoretic MPC by Arpita Patra

MPC-TP: The Best-of-Both-Worlds 1:14:46

MPC-TP: The Best-of-Both-Worlds Secure Multiparty Computation - Arpita Patra

MPC Course Lecture 0:13:18

MPC Course Lecture A Part 1

MPC-TP: Fault-tolerant Distributed 1:12:42

MPC-TP: Fault-tolerant Distributed Consensus - Ashish Choudhury

Conditional Hardness for 1:02:10

Conditional Hardness for Massively Parallel Computing (MPC) Via Distributed Lower Bounds

Oblivious RAM for 0:35:04

Oblivious RAM for MPC

MPC-TP: Probabilistic Termination 0:58:51

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

Communication Efficient MPC 0:48:18

Communication Efficient MPC using Packed Secret Sharing

MPC-TP: Zero-Communication Reduction 1:06:36

MPC-TP: Zero-Communication Reduction - Manoj M Prabhakaran

Resource-Restricted Cryptography: Revisiting 0:18:38

Resource-Restricted Cryptography: Revisiting MPC Bounds in the Proof-of-Work Era

Communication Complexity II 1:02:22

Communication Complexity II

MPC in the 1:01:26

MPC in the Head - Compilers for Zero Knowledge - Yuval Ishai

MPC-TP: MPC – 1:38:12

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

Secure Multi-Party Computation 0:19:27

Secure Multi-Party Computation with Identifiable Abort