Oxana Poburinnaya: Equivocating Yao: Constant-Round Adaptively Secure Multiparty Computation in the Plain Model

Friday, February 24, 2017 - 10:30am to 12:00pm
Hewlett G882
Oxana Poburinnaya, Boston University

Abstract: Yao's garbling scheme is one of the basic building blocks of cryptographic protocol design. Originally designed to enable two-message, two-party secure computation, the scheme has been extended in many ways and has innumerable applications. Still, a basic question has remained open throughout the years: Can the scheme be extended to guarantee security in the face of an adversary that corrupts both parties, adaptively, as the computation proceeds?

We answer this question in the affirmative. We define a new type of encryption, called functionally equivocal encryption (FEE), and show that when Yao's scheme is implemented with an FEE as the underlying encryption mechanism, it becomes secure against such adaptive adversaries. We then show how to implement FEE from any one way function.

Combining our scheme with non-committing encryption, we obtain the first two-message, two-party computation protocol, and the first constant-round multiparty computation protocol, in the plain model, that are secure against semi-honest adversaries who can adaptively corrupt all parties.

Joint work with Ran Canetti and Muthuramakrishnan Venkitasubramaniam