{"id":{"repo_id":"uiuc","oai_identifier":"oai:www.ideals.illinois.edu:2142/108065"},"canonical_url":"https://search.dev.ndltd.org/etd/uiuc/oai:www.ideals.illinois.edu:2142/108065","repository":{"repo_id":"uiuc","name":"University of Illinois - Urbana-Champaign","base_url":"https://www.ideals.illinois.edu/oai-pmh"},"display":{"title":"Succinct publicly auditable MPC with universal setup","abstract":"In recent years, Multiparty computation as a service (MPCSaaS) is gaining popularity as a promising approach for building privacy-preserving communication systems. Although there has been significant improvement in the efficiency and robustness of such protocols, in this thesis, we argue that these properties might not be enough for many MPC applications.Specifically, we need unconditional public auditability, which means that everyone can check that a given (secure) computation was performed correctly, even in the scenario where all the participants involved in the computation are corrupted. We also desire this auditability to be public, meaning any party that did not participate in the computation can audit it.We improve upon the previous state of the art adaptive Trinocchio by Veeningen [1] in three ways: 1) Our auditor has constant pairing cost 2) Our proof sizes are reduced by a factor of three, and 3) we do not rely on a circuit-specific setup.In this work, we show the first construction of auditable robust MPC that supports fast verification, succinct proof size with one time universal, and updatable setup. Importantly,we provide auditability without significantly compromising the performance of the underlying Shamir secret shared MPC protocol, i.e, adding auditability only incurs a linear computation overhead and constant round communication overhead. We implement and evaluate our construction report various performance metrics","abstract_html":"In recent years, Multiparty computation as a service (MPCSaaS) is gaining popularity as a promising approach for building privacy-preserving communication systems. Although there has been significant improvement in the efficiency and robustness of such protocols, in this thesis, we argue that these properties might not be enough for many MPC applications.Specifically, we need unconditional public auditability, which means that everyone can check that a given (secure) computation was performed correctly, even in the scenario where all the participants involved in the computation are corrupted. We also desire this auditability to be public, meaning any party that did not participate in the computation can audit it.We improve upon the previous state of the art adaptive Trinocchio by Veeningen [1] in three ways: 1) Our auditor has constant pairing cost 2) Our proof sizes are reduced by a factor of three, and 3) we do not rely on a circuit-specific setup.In this work, we show the first construction of auditable robust MPC that supports fast verification, succinct proof size with one time universal, and updatable setup. Importantly,we provide auditability without significantly compromising the performance of the underlying Shamir secret shared MPC protocol, i.e, adding auditability only incurs a linear computation overhead and constant round communication overhead. We implement and evaluate our construction report various performance metrics","abstract_has_math":false,"creators":["Kanjalkar, Sanket Makarand"],"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":2020,"date_issued":"2020-08-26T21:58:09Z","date_published":"2020-08-26T21:58:09Z","updated_at":"2026-07-22T22:24:47Z","subjects":["MPC, zk-SNARKs, zero knowledge, auditable MPC, marlin"],"languages":["en"],"rights":["\"Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the \"\"Software\"\"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions: The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software. THE SOFTWARE IS PROVIDED \"\"AS IS\"\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.mmetz2@illinois.edu\""],"rights_urls":[],"identifier_entries":[]},"links":{"outbound_url":"http://hdl.handle.net/2142/108065","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":["Kanjalkar, Sanket Makarand"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2020-08-26T21:58:09Z","2020-05-15","2020-05"]},{"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":["MPC, zk-SNARKs, zero knowledge, auditable MPC, marlin"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["en"]},{"key":"dc:rights","label":"Dc Rights","values":["\"Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the \"\"Software\"\"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions: The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software. THE SOFTWARE IS PROVIDED \"\"AS IS\"\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.mmetz2@illinois.edu\""]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["http://hdl.handle.net/2142/108065"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["In recent years, Multiparty computation as a service (MPCSaaS) is gaining popularity as a promising approach for building privacy-preserving communication systems. Although there has been significant improvement in the efficiency and robustness of such protocols, in this thesis, we argue that these properties might not be enough for many MPC applications.Specifically, we need unconditional public auditability, which means that everyone can check that a given (secure) computation was performed correctly, even in the scenario where all the participants involved in the computation are corrupted. We also desire this auditability to be public, meaning any party that did not participate in the computation can audit it.We improve upon the previous state of the art adaptive Trinocchio by Veeningen [1] in three ways: 1) Our auditor has constant pairing cost 2) Our proof sizes are reduced by a factor of three, and 3) we do not rely on a circuit-specific setup.In this work, we show the first construction of auditable robust MPC that supports fast verification, succinct proof size with one time universal, and updatable setup. Importantly,we provide auditability without significantly compromising the performance of the underlying Shamir secret shared MPC protocol, i.e, adding auditability only incurs a linear computation overhead and constant round communication overhead. We implement and evaluate our construction report various performance metrics","Submission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2020-08-25 without embargo terms","The student, Sanket Makarand Kanjalkar, accepted the attached license on 2020-05-14 at 10:58.","The student, Sanket Makarand Kanjalkar, submitted this Thesis for approval on 2020-05-14 at 11:03.","This Thesis was approved for publication on 2020-05-15 at 07:22.","DSpace SAF Submission Ingestion Package generated from Vireo submission #15393 on 2020-08-25 at 17:14:46","Made available in DSpace on 2020-08-26T21:58:09Z (GMT). No. of bitstreams: 2 KANJALKAR-THESIS-2020.pdf: 671786 bytes, checksum: 6a471958ec2192a6ef0624fdcfb6b27a (MD5) LICENSE.txt: 4222 bytes, checksum: 6da8c23cf686315e9da35b250c8a21a7 (MD5) Previous issue date: 2020-05-15"]},{"key":"dc:format","label":"Dc Format","values":["application/pdf"]},{"key":"dc:title","label":"Title","values":["Succinct publicly auditable MPC with universal setup"]}]}],"canonical_facts":{"dc:contributor":["Miller, Andrew E"],"dc:creator":["Kanjalkar, Sanket Makarand"],"dc:date":["2020-08-26T21:58:09Z","2020-05-15","2020-05"],"dc:description":["In recent years, Multiparty computation as a service (MPCSaaS) is gaining popularity as a promising approach for building privacy-preserving communication systems. Although there has been significant improvement in the efficiency and robustness of such protocols, in this thesis, we argue that these properties might not be enough for many MPC applications.Specifically, we need unconditional public auditability, which means that everyone can check that a given (secure) computation was performed correctly, even in the scenario where all the participants involved in the computation are corrupted. We also desire this auditability to be public, meaning any party that did not participate in the computation can audit it.We improve upon the previous state of the art adaptive Trinocchio by Veeningen [1] in three ways: 1) Our auditor has constant pairing cost 2) Our proof sizes are reduced by a factor of three, and 3) we do not rely on a circuit-specific setup.In this work, we show the first construction of auditable robust MPC that supports fast verification, succinct proof size with one time universal, and updatable setup. Importantly,we provide auditability without significantly compromising the performance of the underlying Shamir secret shared MPC protocol, i.e, adding auditability only incurs a linear computation overhead and constant round communication overhead. We implement and evaluate our construction report various performance metrics","Submission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2020-08-25 without embargo terms","The student, Sanket Makarand Kanjalkar, accepted the attached license on 2020-05-14 at 10:58.","The student, Sanket Makarand Kanjalkar, submitted this Thesis for approval on 2020-05-14 at 11:03.","This Thesis was approved for publication on 2020-05-15 at 07:22.","DSpace SAF Submission Ingestion Package generated from Vireo submission #15393 on 2020-08-25 at 17:14:46","Made available in DSpace on 2020-08-26T21:58:09Z (GMT). No. of bitstreams: 2 KANJALKAR-THESIS-2020.pdf: 671786 bytes, checksum: 6a471958ec2192a6ef0624fdcfb6b27a (MD5) LICENSE.txt: 4222 bytes, checksum: 6da8c23cf686315e9da35b250c8a21a7 (MD5) Previous issue date: 2020-05-15"],"dc:format":["application/pdf"],"dc:identifier":["http://hdl.handle.net/2142/108065"],"dc:language":["en"],"dc:rights":["\"Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the \"\"Software\"\"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions: The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software. THE SOFTWARE IS PROVIDED \"\"AS IS\"\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.mmetz2@illinois.edu\""],"dc:subject":["MPC, zk-SNARKs, zero knowledge, auditable MPC, marlin"],"dc:title":["Succinct publicly auditable MPC with universal setup"],"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:47Z"}