Daniel Genkin: Efficient Multi-Party Computation: from Passive to Active Security using Additive-Attack Resilient Circuits
Date: Friday, February 05, 2016
Time: 10:30 AM to 12:00 PM Note: all times are in the Eastern Time Zone
Location: Hewlett, G882
Host: Vinod Vaikuntanathan
Contact: Deborah Lehto, 617.324.7303, firstname.lastname@example.org
Speaker URL: None
TALK: Daniel Genkin: Efficient Multi-Party Computation: from Passive to Active Security using Additive-Attack Resilient Circuits
A central problem in cryptography is that of converting protocols that offer security against passive (or semi-honest) adversaries into ones that offer security against active (or malicious) adversaries. This problem has been the topic of a large body of work in the area of secure Multi-Party Computation (MPC). Despite these efforts there are still big efficiency gaps between the best protocols in these two settings. In this talk I will present a new paradigm for transforming passively secure MPC protocols into actively secure ones without effecting the communication complexity. Using this approach it is possible to close the communication complexity gap between the passive and the active cases for many natural information theoretic MPC settings. The approach is based on novel techniques for securing circuits against tampering attacks which can be of independent interest.
The talk is based on joint works with Yuval Ishai, Antigoni Polychroniadou, Manoj M. Prabhakaran, Amit Sahai and Eran Tromer.
Created by Deborah Goodwin at Tuesday, January 26, 2016 at 3:41 PM.