Equivocating yao: Constant-round adaptively secure multiparty computation in the plain model

Ran Canetti, Oxana Poburinnaya, Muthuramakrishnan Venkitasubramaniam

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

Yao's circuit 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 face of an adversary that corrupts both parties, adaptively, as the computation proceeds? We answer this question in the afrmative. 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. A number of extensions and applications are described within.

Original languageEnglish
Title of host publicationSTOC 2017 - Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing
EditorsPierre McKenzie, Valerie King, Hamed Hatami
PublisherAssociation for Computing Machinery
Pages497-509
Number of pages13
ISBN (Electronic)9781450345286
DOIs
StatePublished - 19 Jun 2017
Event49th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2017 - Montreal, Canada
Duration: 19 Jun 201723 Jun 2017

Publication series

NameProceedings of the Annual ACM Symposium on Theory of Computing
VolumePart F128415
ISSN (Print)0737-8017

Conference

Conference49th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2017
Country/TerritoryCanada
CityMontreal
Period19/06/1723/06/17

Keywords

  • Adaptive security
  • Garbled circuits
  • Secure computation

Fingerprint

Dive into the research topics of 'Equivocating yao: Constant-round adaptively secure multiparty computation in the plain model'. Together they form a unique fingerprint.

Cite this