CryptoDB
Towards Scalable YOSO MPC via Packed Secret-Sharing
Authors: |
|
---|---|
Download: | |
Conference: | ASIACRYPT 2025 |
Abstract: | The YOSO (You Only Speak Once) model, introduced by Gentry et al. (CRYPTO 2021), helps to achieve strong security guarantees in cryptographic protocols for distributed settings, like blockchains, with large number of parties. YOSO protocols typically employ smaller anonymous committees to execute individual rounds of the protocol instead of having all parties execute the entire protocol. After completing their tasks, parties encrypt protocol messages for the next anonymous committee and erase their internal state before publishing ciphertexts, thereby enhancing security in dynamically changing environments.
In this work, we consider the problem of secure multi-party computation (MPC), a fundamental problem in cryptography and distributed computing. We assume honest majority among the committee members, and work in the online-offline, i.e., preprocessing, setting.
In this context, we present the first YOSO MPC protocol where efficiency---measured as communication complexity---\emph{improves} as the number of parties \emph{increases}. Specifically, for $0<\epsilon<1/2$ and an adversary corrupting $t |
BibTeX
@inproceedings{asiacrypt-2025-36131, title={Towards Scalable YOSO MPC via Packed Secret-Sharing}, publisher={Springer-Verlag}, author={Daniel Escudero and Elisaweta Masserova and Antigoni Polychroniadou}, year=2025 }