International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

Efficient Distributed Randomness Generation from Minimal Assumptions where PArties Speak Sequentially Once

Authors:
Chen-Da Liu-Zhang , Lucerne University of Applied Sciences and Arts & Web3 Foundation
Elisaweta Masserova , Carnegie Mellon University
João Ribeiro , Instituto de Telecomunicações and Instituto Superior Técnico - Universidade de Lisboa
Pratik Soni , University of Utah
Sri AravindaKrishnan Thyagarajan , University of Sydney
Download:
Search ePrint
Search Google
Conference: EUROCRYPT 2025
Abstract: We study efficient public randomness generation protocols in the PASSO (PArties Speak Sequentially Once) model for multi-party computation (MPC). PASSO is a variation of traditional MPC where n parties are executed in sequence and each party ``speaks'' only once, broadcasting and sending secret messages only to parties further down the line. Prior results in this setting include information-theoretic protocols in which the computational complexity scales exponentially with the number of corruptions t (CRYPTO 2022), as well as more efficient computationally-secure protocols either assuming a trusted setup phase or DDH (FC 2024). Moreover, these works only consider security against static adversaries. In this work, we focus on computational security against adaptive adversaries and from minimal assumptions, and improve on the works mentioned above in several ways: - Assuming the existence of non-interactive perfectly binding commitments, we design protocols with n=3t+1 or n=4t parties that are efficient and secure whenever t is small compared to the security parameter λ (e.g., t is constant). This improves the resiliency of all previous protocols, even those requiring a trusted setup. It also shows that n=4 parties are necessary and sufficient for t=1 corruptions in the computational setting, while n=5 parties are required for information-theoretic security. - Under the same assumption, we design protocols with n=4t+2 or n=5t+2 parties (depending on the adversarial network model) which are efficient whenever t=\poly(λ). This improves on the existing DDH-based protocol both in terms of resiliency and the underlying assumptions. - We design efficient protocols with n=5t+3 or n=6t+3 parties (depending on the adversarial network model) assuming the existence of one-way functions. We complement these results by studying lower bounds for randomness generation protocols in the computational setting.
BibTeX
@inproceedings{eurocrypt-2025-35089,
  title={Efficient Distributed Randomness Generation from Minimal Assumptions where PArties Speak Sequentially Once},
  publisher={Springer-Verlag},
  author={Chen-Da Liu-Zhang and Elisaweta Masserova and João Ribeiro and Pratik Soni and Sri AravindaKrishnan Thyagarajan},
  year=2025
}