Explore secure multiparty computation in this Richard M. Karp Distinguished Lecture by Yuval Ishai from Technion Israel Institute of Technology. Delve into the challenges of storing and protecting important data in the digital age, examining solutions like encryption and secret sharing. Investigate the concept of decentralized alternatives and their potential for maintaining confidentiality while allowing data searches. Analyze the broader applications of multiparty computation, including income comparison scenarios and security concerns related to collusion. Examine the landscape of definitions, circuit-based protocols, and specific implementations like the BGW protocol and Yao's Protocol. Consider the challenges of active adversaries and hardware-based trust. Conclude by exploring open questions in feasibility, communication, and computation within the field of secure multiparty computation.
Overview
Syllabus
Intro
Going digital...
How to store important data
What about confidentiality?
Solution 1: Encryption
Solution II: Secret Sharing
Can we still search the data?
A Decentralized Alternative
Rest of Talk
MPC is more general than it may seem
How much do we earn?
A better way?
A security concern
Resisting collusions
From Theory to Practice?
Landscape of Definitions
From Truth-Tables to Circuits
Features of Circuit-Based Protocol
Dealer-free MPC for f(x,y,z)
The "BGW" protocol
Yao's Protocol
Dealing with active adversary
In hardware we trust?
Open Questions: Feasibility
Open Questions: Communication
Open Questions: Computation
Taught by
Simons Institute
Related Courses
-
Optimizing Semi-Honest Secure Multiparty Computation for the Internet
-
Multiparty Computation with Low Communication
-
The Price of Active Security in Cryptographic Protocols
-
Computer Aided Verification and Software Synthesis for Secure Multi Party Computation Protocols
-
Homomorphic Encryption in the SPDZ Protocol for MPC
