RandSolomon: Optimally Resilient Random Number Generator with Deterministic Termination - Archive ouverte HAL Accéder directement au contenu
Proceedings/Recueil Des Communications Année : 2022

RandSolomon: Optimally Resilient Random Number Generator with Deterministic Termination

Résumé

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.
Fichier non déposé

Dates et versions

hal-04460195 , version 1 (15-02-2024)

Identifiants

Citer

Luciano Freitas de Souza, Andrei Tonkikh, Sara Tucci-Piergiovanni, Renaud Sirdey, Oana Stan, et al.. RandSolomon: Optimally Resilient Random Number Generator with Deterministic Termination. 25th International Conference on Principles of Distributed Systems (OPODIS 2021), 217, Schloss Dagstuhl – Leibniz-Zentrum für Informatik, pp.23:1-23:16, 2022, Leibniz International Proceedings in Informatics (LIPIcs), ⟨10.4230/LIPIcs.OPODIS.2021.23⟩. ⟨hal-04460195⟩
24 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Mastodon Facebook X LinkedIn More