Files in this item



application/pdfAGARWAL-THESIS-2021.pdf (482kB)Restricted to U of Illinois
(no description provided)PDF


Title:Two-round maliciously secure computation with super-polynomial simulation
Author(s):Agarwal, Amit
Advisor(s):Khurana, Dakshita; Miller, Andrew
Department / Program:Computer Science
Discipline:Computer Science
Degree Granting Institution:University of Illinois at Urbana-Champaign
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
Issue Date:2021-12-09
Rights Information:© International Association for Cryptologic Research 2021, doi:10.1007/978-3-030-90459-3_22
Date Available in IDEALS:2022-04-29
Date Deposited:2021-12

This item appears in the following Collection(s)

Item Statistics