2026-07-23T22:37:52Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:15798 2024-03-06T10:56:11Z ddc:004 open_access

RandSolomon: Optimally Resilient Random Number Generator with Deterministic Termination Freitas de Souza, Luciano Tonkikh, Andrei Tucci-Piergiovanni, Sara Sirdey, Renaud Stan, Oana Quero, Nicolas Kuznetsov, Petr Byzantine Fault Tolerance Partially Synchronous Deterministic Termination Randomness Beacon Multi Party Computation BFT-RNG 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. This paper presents RandSolomon, a partially synchronous protocol that allows a system of N processes to produce an unpredictable common random number shared by correct participants. The protocol is optimally resilient, as it allows up to f = ⌊(N-1)/3⌋ of the processes to behave arbitrarily, ensures deterministic termination and, contrary to prior solutions, does not, at any point, expect faulty processes to be responsive. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Luciano Freitas de Souza and Andrei Tonkikh and Sara Tucci-Piergiovanni and Renaud Sirdey and Oana Stan and Nicolas Quero and Petr Kuznetsov 2022 Is Part Of LIPIcs, Volume 217, 25th International Conference on Principles of Distributed Systems (OPODIS 2021) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.OPODIS.2021.23 urn:nbn:de:0030-drops-157986 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.OPODIS.2021.23 eng https://creativecommons.org/licenses/by/4.0/legalcode