Skip to main navigation Skip to search Skip to main content

RandSolomon: Optimally Resilient Random Number Generator with Deterministic Termination

  • Luciano Freitas de Souza
  • , Andrei Tonkikh
  • , Sara Tucci-Piergiovanni
  • , Renaud Sirdey
  • , Oana Stan
  • , Nicolas Quero
  • , Petr Kuznetsov
  • Université Paris-Saclay
  • Institut Polytechnique de Paris

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

3 Citations (Scopus)

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. 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 = ⌊N3-1 ⌋ 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.

Original languageEnglish
Title of host publication25th International Conference on Principles of Distributed Systems, OPODIS 2021
EditorsQuentin Bramas, Vincent Gramoli, Vincent Gramoli, Alessia Milani
PublisherSchloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
ISBN (Electronic)9783959772198
DOIs
Publication statusPublished - 1 Feb 2022
Event25th International Conference on Principles of Distributed Systems, OPODIS 2021 - Strasbourg, France
Duration: 13 Dec 2021 → 15 Dec 2021

Publication series

NameLeibniz International Proceedings in Informatics, LIPIcs
Volume217
ISSN (Print)1868-8969

Conference

Conference25th International Conference on Principles of Distributed Systems, OPODIS 2021
Country/TerritoryFrance
CityStrasbourg
Period13/12/21 → 15/12/21

Keywords

  • BFT-RNG
  • Byzantine Fault Tolerance
  • Deterministic Termination
  • Multi Party Computation
  • Partially Synchronous
  • Randomness Beacon

Fingerprint

Dive into the research topics of 'RandSolomon: Optimally Resilient Random Number Generator with Deterministic Termination'. Together they form a unique fingerprint.

Cite this