A New Approach to Round-Optimal Secure Multiparty Computation

Speaker: Prabhanjan Ananth

Date: Friday, October 06, 2017

Time: 10:30 AM to 12:00 PM Note: all times are in the Eastern Time Zone

Public: Yes

Location: 32-G882

Event Type: Seminar

Room Description:

Host: Vinod Vaikuntanathan, MIT CSAIL

Contact: Nardos Abbay, nardos@csail.mit.edu

Relevant URL:

Speaker URL:

Speaker Photo:
None

Reminders to: seminars@csail.mit.edu, cis-seminars@csail.mit.edu

Reminder Subject: TALK: A New Approach to Round-Optimal Secure Multiparty Computation

Abstract: We present a new approach towards constructing round-optimal secure multiparty computation (MPC) protocols against malicious adversaries without trusted setup assumptions. Our approach builds on ideas previously developed in the context of covert multiparty computation [Chandran et al., FOCS’07] even though we do not seek covert security. Using our new approach, we obtain the following results:

1) A five round MPC protocol based on the Decisional Diffie-Hellman (DDH) assumption.

2) A four round MPC protocol based on one-way permutations and sub-exponentially secure DDH. This result is optimal in the number of rounds. Previously, no four-round MPC protocol for general functions was known and five-round protocols were only known based on indistinguishability obfuscation (and some additional assumptions) [Garg et al., EUROCRYPT’16].

Joint work with Arka Rai Choudhuri (JHU) and Abhishek Jain (JHU)

Research Areas:

Impact Areas:

See other events that are part of the Cryptography and Information Seminar (CIS) 2017.

Created by Nardos Abbay Email at Wednesday, September 20, 2017 at 5:27 PM.