Multi-Party Computation: Theory to Practice π€
Nigel P. Smart explains how Multi-Party Computation enables secure collaborative computation, bridging theory and practical applications.
Google TechTalks
19.8K views β’ Jan 10, 2013
About this video
Google Tech Talk
1/8/13
Presented by Nigel P. Smart
ABSTRACT
Multi-Party Computation (MPC) allows, in theory, a set of parties to compute any function on their secret input without revealing anything bar the output of the function. For many years this has been a restricted to a theoretical tool in cryptography. However, in the past five years amazing strides have been made in turning theory into practice. In this talk I will present the latest, practical, protocol called SPDZ (Speedz), which achieves much of its performance advantage from the use of Fully Homomorphic Encryption as a sub-procedure. No prior knowledge of MPC will be assumed.
Speaker Info
University of Bristol, U.K.
1/8/13
Presented by Nigel P. Smart
ABSTRACT
Multi-Party Computation (MPC) allows, in theory, a set of parties to compute any function on their secret input without revealing anything bar the output of the function. For many years this has been a restricted to a theoretical tool in cryptography. However, in the past five years amazing strides have been made in turning theory into practice. In this talk I will present the latest, practical, protocol called SPDZ (Speedz), which achieves much of its performance advantage from the use of Fully Homomorphic Encryption as a sub-procedure. No prior knowledge of MPC will be assumed.
Speaker Info
University of Bristol, U.K.
Tags and Topics
Browse our collection to discover more content in these categories.
Video Information
Views
19.8K
Likes
185
Duration
54:29
Published
Jan 10, 2013
User Reviews
4.3
(3) Related Trending Topics
LIVE TRENDSRelated trending topics. Click any trend to explore more videos.