Muthuramakrishnana Venkitasubramaniam: Composable Adaptive Secure Protocols without Setup Under Polytime Assumptions

Speaker: Muthuramakrishnana Venkitasubramaniam, University of rochester

Date: Friday, October 28, 2016

Time: 10:30 AM to 12:00 PM

Public: Yes

Location: Hewlett, G882

Event Type:

Room Description:

Host: Vinod Vaikuntanathan

Contact: Deborah Goodwin, 617.324.7303, dlehto@csail.mit.edu

Relevant URL:

Speaker URL: None

Speaker Photo:
None

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

Reminder Subject: TALK: Muthuramakrishnana Venkitasubramaniam: Composable Adaptive Secure Protocols without Setup Under Polytime Assumptions

Abstract: All previous constructions of general multiparty computation protocols that are secure against adaptive corruptions in the concurrent setting either require some form of setup or non-standard assumptions. In this paper we provide the first general construction of secure multi-party computation protocol without any setup that guarantees composable security in the presence of an adaptive adversary based on standard polynomial-time assumptions. We prove security under the notion of “UC with super-polynomial helpers” introduced by Canetti Lin and Pass (FOCS 2010), which is closed under universal composition and implies “superpolynomial-time simulation”. Moreover, our construction relies on the underlying cryptographic primitives in a black-box manner.

Joint work with Carmit Hazay.

Research Areas:

Impact Areas:

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

Created by Deborah Goodwin Email at Monday, October 24, 2016 at 9:35 AM.