{"id":{"repo_id":"uiuc","oai_identifier":"oai:www.ideals.illinois.edu:2142/104886"},"canonical_url":"https://search.dev.ndltd.org/etd/uiuc/oai:www.ideals.illinois.edu:2142/104886","repository":{"repo_id":"uiuc","name":"University of Illinois - Urbana-Champaign","base_url":"https://www.ideals.illinois.edu/oai-pmh"},"display":{"title":"Scaling asynchronous multi-party computation: A systems perspective","abstract":"Modern multi-party computation applications no longer have a one-time execution pattern and instead are required to be run continuously like a service. They are deployed over the Internet which is inherently asynchronous and demand an infrastructure which is end-to-end robust, fault-tolerant and scalable. Unfortunately, existing frameworks fail to satisfy all of these requirements. Hence, many MPC applications are not yet practical due to the lack of an MPC framework that meets these needs. This work presents a scalable protocol for generating preprocessed elements required for the execution of asynchronous MPC applications with optimal Byzantine fault-tolerance (robust when one-third of the nodes are corrupt) in the asynchronous setting. We implement this preprocessing protocol in HoneyBadgerMPC – a scalable, robust and fault-tolerant framework designed to develop, test and benchmark MPC applications efficiently.","abstract_html":"Modern multi-party computation applications no longer have a one-time execution pattern and instead are required to be run continuously like a service. They are deployed over the Internet which is inherently asynchronous and demand an infrastructure which is end-to-end robust, fault-tolerant and scalable. Unfortunately, existing frameworks fail to satisfy all of these requirements. Hence, many MPC applications are not yet practical due to the lack of an MPC framework that meets these needs. This work presents a scalable protocol for generating preprocessed elements required for the execution of asynchronous MPC applications with optimal Byzantine fault-tolerance (robust when one-third of the nodes are corrupt) in the asynchronous setting. We implement this preprocessing protocol in HoneyBadgerMPC – a scalable, robust and fault-tolerant framework designed to develop, test and benchmark MPC applications efficiently.","abstract_has_math":false,"creators":["Kulshreshtha, Samarth"],"institution":"University of Illinois at Urbana-Champaign","degree_name":"M.S.","degree_level":"Thesis","degree_discipline":"Computer Science","degree_department":null,"school":null,"contributors":["Miller, Andrew E"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2019,"date_issued":"2019-08-23T19:58:05Z","date_published":"2019-08-23T19:58:05Z","updated_at":"2026-07-22T22:24:42Z","subjects":["Systems","Multi-party Computation","Cryptography"],"languages":["en"],"rights":["Copyright 2019 Samarth Kulshreshtha"],"rights_urls":[],"identifier_entries":[]},"links":{"outbound_url":"http://hdl.handle.net/2142/104886","outbound_label":"Handle","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Miller, Andrew E"]},{"key":"dc:creator","label":"Author","values":["Kulshreshtha, Samarth"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2019-08-23T19:58:05Z","2019-04-22","2019-05"]},{"key":"dc:type","label":"Dc Type","values":["text"]},{"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":["Systems","Multi-party Computation","Cryptography"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["en"]},{"key":"dc:rights","label":"Dc Rights","values":["Copyright 2019 Samarth Kulshreshtha"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["http://hdl.handle.net/2142/104886"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["Modern multi-party computation applications no longer have a one-time execution pattern and instead are required to be run continuously like a service. They are deployed over the Internet which is inherently asynchronous and demand an infrastructure which is end-to-end robust, fault-tolerant and scalable. Unfortunately, existing frameworks fail to satisfy all of these requirements. Hence, many MPC applications are not yet practical due to the lack of an MPC framework that meets these needs. This work presents a scalable protocol for generating preprocessed elements required for the execution of asynchronous MPC applications with optimal Byzantine fault-tolerance (robust when one-third of the nodes are corrupt) in the asynchronous setting. We implement this preprocessing protocol in HoneyBadgerMPC – a scalable, robust and fault-tolerant framework designed to develop, test and benchmark MPC applications efficiently.","Submission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2019-08-22 without embargo terms","The student, Samarth Kulshreshtha, accepted the attached license on 2019-04-19 at 15:39.","The student, Samarth Kulshreshtha, submitted this Thesis for approval on 2019-04-19 at 15:46.","This Thesis was approved for publication on 2019-04-22 at 15:27.","DSpace SAF Submission Ingestion Package generated from Vireo submission #13792 on 2019-08-22 at 14:45:08","Made available in DSpace on 2019-08-23T19:58:05Z (GMT). No. of bitstreams: 2 KULSHRESHTHA-THESIS-2019.pdf: 1034715 bytes, checksum: 04d5317d804894aede52124775ba9a45 (MD5) LICENSE.txt: 4217 bytes, checksum: 2c21de14405433aad45fe4a01bd081f7 (MD5) Previous issue date: 2019-04-22"]},{"key":"dc:format","label":"Dc Format","values":["application/pdf"]},{"key":"dc:title","label":"Title","values":["Scaling asynchronous multi-party computation: A systems perspective"]}]}],"canonical_facts":{"dc:contributor":["Miller, Andrew E"],"dc:creator":["Kulshreshtha, Samarth"],"dc:date":["2019-08-23T19:58:05Z","2019-04-22","2019-05"],"dc:description":["Modern multi-party computation applications no longer have a one-time execution pattern and instead are required to be run continuously like a service. They are deployed over the Internet which is inherently asynchronous and demand an infrastructure which is end-to-end robust, fault-tolerant and scalable. Unfortunately, existing frameworks fail to satisfy all of these requirements. Hence, many MPC applications are not yet practical due to the lack of an MPC framework that meets these needs. This work presents a scalable protocol for generating preprocessed elements required for the execution of asynchronous MPC applications with optimal Byzantine fault-tolerance (robust when one-third of the nodes are corrupt) in the asynchronous setting. We implement this preprocessing protocol in HoneyBadgerMPC – a scalable, robust and fault-tolerant framework designed to develop, test and benchmark MPC applications efficiently.","Submission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2019-08-22 without embargo terms","The student, Samarth Kulshreshtha, accepted the attached license on 2019-04-19 at 15:39.","The student, Samarth Kulshreshtha, submitted this Thesis for approval on 2019-04-19 at 15:46.","This Thesis was approved for publication on 2019-04-22 at 15:27.","DSpace SAF Submission Ingestion Package generated from Vireo submission #13792 on 2019-08-22 at 14:45:08","Made available in DSpace on 2019-08-23T19:58:05Z (GMT). No. of bitstreams: 2 KULSHRESHTHA-THESIS-2019.pdf: 1034715 bytes, checksum: 04d5317d804894aede52124775ba9a45 (MD5) LICENSE.txt: 4217 bytes, checksum: 2c21de14405433aad45fe4a01bd081f7 (MD5) Previous issue date: 2019-04-22"],"dc:format":["application/pdf"],"dc:identifier":["http://hdl.handle.net/2142/104886"],"dc:language":["en"],"dc:rights":["Copyright 2019 Samarth Kulshreshtha"],"dc:subject":["Systems","Multi-party Computation","Cryptography"],"dc:title":["Scaling asynchronous multi-party computation: A systems perspective"],"dc:type":["text"],"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:42Z"}