Seminars & Colloquia Calendar
Equivocating Yao: Constant-Rounds Adaptively Secure Multiparty Computation in the Plain Model
Location: Other - CoRE 301
Date & time: Wednesday, 18 January 2017 at 11:00AM - 11:11AM
We provide a positive answer to this question. 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-rounds multiparty computation protocol, in the plain model, that are secure against semi-honest adversaries who can adaptively corrupt all parties. We also provide extensions to the multiparty setting (with UC-security) and applications to leakage resilience.