{"id":{"repo_id":"uiuc","oai_identifier":"oai:www.ideals.illinois.edu:2142/114024"},"canonical_url":"https://search.dev.ndltd.org/etd/uiuc/oai:www.ideals.illinois.edu:2142/114024","repository":{"repo_id":"uiuc","name":"University of Illinois - Urbana-Champaign","base_url":"https://www.ideals.illinois.edu/oai-pmh"},"display":{"title":"Two-round maliciously secure computation with super-polynomial simulation","abstract":"Submission published under a 24 month embargo labeled 'U of I Access', the embargo will last until 2023-12-01","abstract_html":"Submission published under a 24 month embargo labeled 'U of I Access', the embargo will last until 2023-12-01","abstract_has_math":false,"creators":["Agarwal, Amit"],"institution":"University of Illinois at Urbana-Champaign","degree_name":"M.S.","degree_level":"Thesis","degree_discipline":"Computer Science","degree_department":null,"school":null,"contributors":["Khurana, Dakshita","Miller, Andrew"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2022,"date_issued":"2022-04-29T21:47:47Z","date_published":"2022-04-29T21:47:47Z","updated_at":"2026-07-22T22:24:54Z","subjects":["Computer science"],"languages":["en","eng"],"rights":["© International Association for Cryptologic Research 2021, doi:10.1007/978-3-030-90459-3_22"],"rights_urls":[],"identifier_entries":[]},"links":{"outbound_url":"http://hdl.handle.net/2142/114024","outbound_label":"Handle","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Khurana, Dakshita","Miller, Andrew"]},{"key":"dc:creator","label":"Author","values":["Agarwal, Amit"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2022-04-29T21:47:47Z","2024-04-29T21:47:53Z","2021-12","2021-12-09"]},{"key":"dc:type","label":"Dc Type","values":["text","Thesis"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Computer Science"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Thesis"]},{"key":"thesis:degree_name","label":"Degree Name","values":["M.S."]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["University of Illinois at Urbana-Champaign"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Computer science"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["en","eng"]},{"key":"dc:rights","label":"Dc Rights","values":["© International Association for Cryptologic Research 2021, doi:10.1007/978-3-030-90459-3_22"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["http://hdl.handle.net/2142/114024"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["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","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"]},{"key":"dc:format","label":"Dc Format","values":["application/pdf"]},{"key":"dc:title","label":"Title","values":["Two-round maliciously secure computation with super-polynomial simulation"]}]}],"canonical_facts":{"dc:contributor":["Khurana, Dakshita","Miller, Andrew"],"dc:creator":["Agarwal, Amit"],"dc:date":["2022-04-29T21:47:47Z","2024-04-29T21:47:53Z","2021-12","2021-12-09"],"dc:description":["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","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"],"dc:format":["application/pdf"],"dc:identifier":["http://hdl.handle.net/2142/114024"],"dc:language":["en","eng"],"dc:rights":["© International Association for Cryptologic Research 2021, doi:10.1007/978-3-030-90459-3_22"],"dc:subject":["Computer science"],"dc:title":["Two-round maliciously secure computation with super-polynomial simulation"],"dc:type":["text","Thesis"],"thesis:degree_discipline":["Computer Science"],"thesis:degree_level":["Thesis"],"thesis:degree_name":["M.S."],"thesis:institution_name":["University of Illinois at Urbana-Champaign"]},"updated_at":"2026-07-22T22:24:54Z"}