Two-round maliciously secure computation with super-polynomial simulation
Agarwal, Amit
Loading…
Permalink
https://hdl.handle.net/2142/114024
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
Date of Ingest
2022-04-29T21:47:47Z
Keyword(s)
Computer science
Language
eng
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
Use this login method if you
don't
have an
@illinois.edu
email address.
(Oops, I do have one)
IDEALS migrated to a new platform on June 23, 2022. If you created
your account prior to this date, you will have to reset your password
using the forgot-password link below.
