YOSO: You Only Speak Once - Secure MPC with Stateless Ephemeral Roles
Craig Gentry, Shai Halevi, Hugo Krawczyk, Bernardo Magri, Jesper Buus Nielsen, Tal Rabin, Sophia Yakoubov
摘要
The inherent difficulty of maintaining stateful environments over long periods of time gave rise to the paradigm of serverless computing, where mostly-stateless components are deployed on demand to handle computation tasks, and are teared down once their task is complete. Serverless architecture could offer the added benefit of improved resistance to targeted denial-of-service attacks, by hiding from the attacker the physical machines involved in the protocol until after they complete their work. Realizing such protection, however, requires that the protocol only uses stateless parties, where each party sends only one message and never needs to speaks again. Perhaps the most famous example of this style of protocols is the Nakamoto consensus protocol used in Bitcoin: A peer can win the right to produce the next block by running a local lottery (mining), all while staying covert. Once the right has been won, it is executed by sending a single message. After that, the physical entity never needs to send more messages.
We refer to this as the You-Only-Speak-Once (YOSO) property, and initiate the formal study of it within a new model that we call the YOSO model. Our model is centered around the notion of roles, which are stateless parties that can only send a single message. Crucially, our modelling separates the protocol design, that only uses roles, from the role-assignment mechanism, that assigns roles to actual physical entities. This separation enables studying these two aspects separately, and our YOSO model in this work only deals with the protocol-design aspect.
We describe several techniques for achieving YOSO MPC; both computational and information theoretic. Our protocols are synchronous and provide guaranteed output delivery (which is important for application domains such as blockchains), assuming honest majority of roles in every time step. We describe a practically efficient computationally-secure protocol, as well as a proof-of-concept information theoretically secure protocol.
问问这篇 Paper
问问你的智能体。
Lune 读过与它相关的顶会 Paper,每个回答都会注明依据哪几篇。
引用它的顶会 Paper14
- Le Mans: Dynamic and Fluid MPC for Dishonest MajorityRahul Rachuri, Peter SchollCRYPTO 2022 · 被引用 42 次
- Cryptography with Weights: MPC, Encryption and SignaturesSanjam Garg, Abhishek Jain, Pratyay Mukherjee, Rohit Sinha 等CRYPTO 2023 · 被引用 23 次
- Perfect MPC over Layered GraphsBernardo David, Giovanni Deligios, Aarushi Goel, Yuval Ishai 等CRYPTO 2023 · 被引用 21 次
- Riggs: Decentralized Sealed-Bid AuctionsNirvan Tyagi, Arasu Arun, Cody Freitag, Riad S. Wahby 等CCS 2023 · 被引用 15 次
- Threshold Cryptography as a Service (in the Multiserver and YOSO Models)Fabrice Benhamouda, Shai Halevi, Hugo Krawczyk, Alex Miao 等CCS 2022 · 被引用 13 次
相关 Paper
- Public Randomness Extraction with Ephemeral Roles and Worst-Case CorruptionsJesper Buus Nielsen, João Ribeiro, Maciej ObremskiCRYPTO 2022 · 被引用 8 次
- Secure Multiparty Computation from Threshold Encryption Based on Class GroupsLennart Braun, Ivan Damgård, Claudio OrlandiCRYPTO 2023 · 被引用 47 次
- Towards Practical Committee Sizes in YOSO MPCPawel Kedzior, Marcin Mielniczuk, Daniele VenturiCRYPTO 2026
- sfOPA: One-Shot Private Aggregation with Single Client Interaction and Its Applications to Federated LearningHarish Karthikeyan, Antigoni PolychroniadouCRYPTO 2025 · 被引用 1 次
- The Generals' Scuttlebutt: Byzantine-Resilient Gossip ProtocolsSandro Coretti, Aggelos Kiayias, Cristopher Moore, Alexander RussellCCS 2022 · 被引用 23 次
