Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Lecture notes in computer science

Taming Adaptivity in YOSO Protocols: The Modular Way

Ran Canetti, Sebastian Kolby, Divya Ravi, Eduardo Soria-Vázquez, Sophia Yakoubov

Published Jan 1, 2023• 12 citations
Publisher
DOI
10.1007/978-3-031-48618-0_2

Related papers

Nested YOSO: Optimal Resilience from a PKI

Ittai Abraham, Eli Chouatt, Ivan Damgård +3 more

Lecture notes in computer science•Oct 30, 2026•0 citations

Towards Practical Committee Sizes in YOSO MPC

Paweł Kędzior, Marcin Mielniczuk, Daniele Venturi

Lecture notes in computer science•Jan 1, 2026•0 citations

Towards Scalable YOSO MPC via Packed Secret-Sharing

Daniel E. Escudero, Elisaweta Masserova, Antigoni Polychroniadou

Lecture notes in computer science•Dec 7, 2025•2 citations

Constant-Round YOSO MPC Without Setup

Sebastian Kolby, Divya Ravi, Sophia Yakoubov

YOSO MPC (Gentry et al., Crypto 2021) is a new MPC framework where each participant can speak at most once. This models an adaptive adversary’s ability to watch the network and corrupt or destroy parties it deems significant based on their communication. By using private channels to anonymous receivers (e.g. by encrypting to a public key whose owner is unknown), the communication complexity of YOSO MPC can scale sublinearly with the total number N of available parties, even when the adversary’s corruption threshold is linear in N (e.g. just under N/2). It was previously an open problem whether YOSO MPC can achieve guaranteed output delivery in a constant number of rounds without relying on trusted setup. In this work, we show that this can indeed be accomplished. We demonstrate three different approaches: the first two (which we call YaOSO and YOSO-GLS) use two and three rounds of communication, respectively. Our third approach (which we call YOSO-LHSS) uses O(d) rounds, where d is the multiplicative depth of the circuit being evaluated; however, it can be used to bootstrap any constant-round YOSO protocol that requires setup, by generating that setup within YOSO-LHSS. Though YOSO-LHSS requires more rounds than our first two approaches, it may be more practical, since the zero knowledge proofs it employs are more efficient to instantiate. As a contribution of independent interest, we introduce a verifiable state propagation UC functionality, which allows parties to send private message which are verifiably derived in the “correct” way (according to the protocol in question) to anonymous receivers. This is a natural functionality to build YOSO protocols on top of.

IACR Communications in Cryptology•Oct 7, 2024•3 citations

Towards Building Efficient SCALES Protocols

Anasuya Acharya, Carmit Hazay, Vladimir Kolesnikov +1 more

Lecture notes in computer science•Dec 7, 2025•3 citations

A Novel Framework for Protocol Analysis

Kristian Gjøsteen, George Petrides, Asgeir Steine

Lecture notes in computer science•Jan 1, 2011•3 citations
YOSO MPC (Gentry et al., Crypto 2021) is a new MPC framework where each participant can speak at most once. This models an adaptive adversary’s ability to watch the network and corrupt or destroy parties it deems significant based on their communication. By using private channels to anonymous receivers (e.g. by encrypting to a public key whose owner is unknown), the communication complexity of YOSO MPC can scale sublinearly with the total number N of available parties, even when the adversary’s corruption threshold is linear in N (e.g. just under N/2). It was previously an open problem whether YOSO MPC can achieve guaranteed output delivery in a constant number of rounds without relying on trusted setup. In this work, we show that this can indeed be accomplished. We demonstrate three different approaches: the first two (which we call YaOSO and YOSO-GLS) use two and three rounds of communication, respectively. Our third approach (which we call YOSO-LHSS) uses O(d) rounds, where d is the multiplicative depth of the circuit being evaluated; however, it can be used to bootstrap any constant-round YOSO protocol that requires setup, by generating that setup within YOSO-LHSS. Though YOSO-LHSS requires more rounds than our first two approaches, it may be more practical, since the zero knowledge proofs it employs are more efficient to instantiate. As a contribution of independent interest, we introduce a verifiable state propagation UC functionality, which allows parties to send private message which are verifiably derived in the “correct” way (according to the protocol in question) to anonymous receivers. This is a natural functionality to build YOSO protocols on top of.