Two-round maliciously secure computation with super-polynomial simulation

Agarwal, Amit

Permalink

https://hdl.handle.net/2142/114024 Copy

Description

Title

Two-round maliciously secure computation with super-polynomial simulation

Author(s)

Agarwal, Amit

Issue Date

2021-12-09

Director of Research (if dissertation) or Advisor (if thesis)

• Khurana, Dakshita
• Miller, Andrew

Department of Study

Computer Science

Discipline

Computer Science

Degree Granting Institution

University of Illinois at Urbana-Champaign

Degree Name

M.S.

Degree Level

Thesis

Keyword(s)

• Cryptography
• Secure Multiparty Computation
• Super-Polynomial Simulation

Abstract

We propose the first maliciously secure multi-party computation (MPC) protocol for general functionalities in two rounds, without any trusted setup. Since polynomial-time simulation is impossible in two rounds, we achieve the relaxed notion of superpolynomial-time simulation security [Pass, EUROCRYPT 2003]. Prior to our work, no such maliciously secure protocols were known even in the two-party setting for functionalities where both parties receive outputs. Our protocol is based on the sub-exponential security of standard assumptions plus a special type of non-interactive non-malleable commitment. At the heart of our approach is a two-round multi-party conditional disclosure of secrets (MCDS) protocol in the plain model from bilinear maps, which is constructed from techniques introduced in [Benhamouda and Lin, TCC 2020]. This thesis is based on a joint work with James Bartusek, Vipul Goyal, Dakshita Khurana, and Giulio Malavolta

Graduation Semester

2021-12

Type of Resource

Thesis

Permalink

http://hdl.handle.net/2142/114024

Copyright and License Information

© International Association for Cryptologic Research 2021, doi:10.1007/978-3-030-90459-3_22

Owning Collections