Abstract
The recently proposed YOSO model is a groundbreaking approach to MPC, executable on a public blockchain, circumventing adaptive player corruption by hiding the corruption targets until they are worthless. Players are selected unpredictably from a large pool to perform MPC subtasks, in which each selected player sends a single message (and reveals their identity). While YOSO MPC has attractive asymptotic complexity, unfortunately, it is concretely prohibitively expensive due to the cost of its building blocks. We propose a modification to the YOSO model that preserves resilience to adaptive server corruption, but allows for much more efficient protocols. In SCALES (Small Clients And Larger Ephemeral Servers) only the servers facilitating the MPC computation are ephemeral (unpredictably selected and “speak once”). Input providers (clients) publish problem instance and collect the output, but do not otherwise participate in computation SCALES offers attractive features, and improves over YOSO in outsourcing MPC to a large pool of servers under adaptive corruption. We build SCALES from Rerandomizable Garbling Schemes (RGS). RGS is a contribution of independent interest with additional applications.
| Original language | English |
|---|---|
| Title of host publication | Theory of Cryptography - 20th International Conference, TCC 2022, Proceedings |
| Editors | Eike Kiltz, Vinod Vaikuntanathan |
| Publisher | Springer Science and Business Media Deutschland GmbH |
| Pages | 502-531 |
| Number of pages | 30 |
| ISBN (Print) | 9783031223648 |
| DOIs | |
| State | Published - 2022 |
| Event | 20th Theory of Cryptography Conference, TCC 2022 - Chicago, United States Duration: 7 Nov 2022 → 10 Nov 2022 |
Publication series
| Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
|---|---|
| Volume | 13748 LNCS |
| ISSN (Print) | 0302-9743 |
| ISSN (Electronic) | 1611-3349 |
Conference
| Conference | 20th Theory of Cryptography Conference, TCC 2022 |
|---|---|
| Country/Territory | United States |
| City | Chicago |
| Period | 7/11/22 → 10/11/22 |
Bibliographical note
Publisher Copyright:© 2022, The Author(s), under exclusive license to Springer Nature Switzerland AG.
Funding
Acknowledgments. We thank Shai Halevi for discussions including feedback regarding the gap in [GHV10]. Anasuya Acharya and Carmit Hazay are supported by the BIU Center for Research in Applied Cryptography and Cyber Security in conjunction with the Israel National Cyber Bureau in the Prime Minister’s Office, and by ISF grant No. 1316/18. Vladimir Kolesnikov was supported in part by NSF award #1909769, by a Facebook research award, a Cisco research award, and by Georgia TechâĂŹs IISP cybersecurity seed funding (CSF) award. Manoj Prabhakaran is supported by a Ramanujan Fellowship of the Department of Science and Technology, India. Car-mit Hazay and Manoj Prabhakaran are also supported by the Algorand Centres of Excellence programme managed by Algorand Foundation. Any opinions, findings, and conclusions or recommendations expressed in this material are those of the author(s) and do not necessarily reflect the views of Algorand Foundation.
| Funders | Funder number |
|---|---|
| Algorand Foundation | |
| Georgia TechâĂŹs IISP | |
| National Science Foundation | 1909769 |
| Department of Science and Technology, Ministry of Science and Technology, India | |
| Israel Science Foundation | 1316/18 |