2026-09-21T18:32:03Z https://www.ideals.illinois.edu/oai-pmh

oai:www.ideals.illinois.edu:2142/114024 2023-07-11 col_2142_5131 col_2142_10761 com_2142_5130 com_2142_10755 com_2142_234

Khurana, Dakshita Miller, Andrew 2022-04-29T21:47:47Z 2024-04-29T21:47:53Z 2021-12 Submission published under a 24 month embargo labeled 'U of I Access', the embargo will last until 2023-12-01 The student, Amit Agarwal, accepted the attached license on 2021-12-08 at 22:15. The student, Amit Agarwal, submitted this Thesis for approval on 2021-12-09 at 00:33. This Thesis was approved for publication on 2021-12-09 at 15:27. DSpace SAF Submission Ingestion Package generated from Vireo submission #17428 on 2022-04-06 at 17:18:04 Made available in DSpace on 2022-04-29T21:47:47Z (GMT). No. of bitstreams: 3 AGARWAL-THESIS-2021.pdf: 482085 bytes, checksum: e1df4a0641d08ccdb5fdd1cdccedcd57 (MD5) LICENSE.txt: 4209 bytes, checksum: 0317e03a4c55566c88830cb0deefd49d (MD5) reprint_permission_and_copyright.pdf: 152728 bytes, checksum: 9eed78c852b91d82bb35221a14a8fd09 (MD5) Previous issue date: 2021-12-09 Embargo set by: Seth Robbins for item 123389 Lift date: 2024-04-29T21:47:53Z Reason: Author requested U of Illinois access only (OA after 2yrs) in Vireo ETD system Author requested U of Illinois access only (OA after 2yrs) in Vireo ETD system U of I Only application/pdf en text Two-round maliciously secure computation with super-polynomial simulation Agarwal, Amit 2021-12-09 Computer science 2022-04-29T21:47:47Z 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 Thesis eng http://hdl.handle.net/2142/114024 © International Association for Cryptologic Research 2021, doi:10.1007/978-3-030-90459-3_22 Computer Science Computer Science University of Illinois at Urbana-Champaign Thesis M.S.