RandSolomon: Optimally Resilient Random Number Generator with Deterministic Termination

DOI10.4230/LIPICS.OPODIS.2021.23MaRDI QIDQ6128589zbMATH OpenOpenAlexFDO

Authors Andrei Tonkikh, Sara Tucci Piergiovanni, Renaud Sirdey, Oana Stan, Petr Kuznetsov

Publication date 15 April 2024

Full work available at URL https://arxiv.org/abs/2109.04911

Byzantine fault tolerance multi party computation randomness beacon BFT-RNG deterministic termination partially synchronous

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Distributed systems (68M14)

Abstract: Multi-party random number generation is a key building-block in many practical protocols. While straightforward to solve when all parties are trusted to behave correctly, the problem becomes much more difficult in the presence of faults. In this context, this paper presents RandSolomon, a protocol that allows a network of N processes to produce an unpredictable common random number among the non-faulty of them. We provide optimal resilience for partially-synchronous systems where less than a third of the participants might behave arbitrarily and, contrary to many solutions, we do not require at any point faulty-processes to be responsive.

This page was built for publication: RandSolomon: Optimally Resilient Random Number Generator with Deterministic Termination

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6128589)