Skip to Main content Skip to Navigation
Conference papers

Signature-Free Asynchronous Byzantine Consensus with $t < n/3$ and $O(n^2)$ Messages

Achour Mostefaoui 1 Moumen Hamouna 2 Michel Raynal 3
1 GDD - Gestion de Données Distribuées [Nantes]
LINA - Laboratoire d'Informatique de Nantes Atlantique
3 ASAP - As Scalable As Possible: foundations of large scale dynamic distributed systems
IRISA-D1 - SYSTÈMES LARGE ÉCHELLE, Inria Rennes – Bretagne Atlantique
Abstract : This paper presents a new round-based asynchronous consensus algorithm that copes with up to t
Complete list of metadata

Cited literature [38 references]  Display  Hide  Download

https://hal.inria.fr/hal-00944019
Contributor : Michel Raynal <>
Submitted on : Tuesday, February 11, 2014 - 11:40:22 AM
Last modification on : Wednesday, June 16, 2021 - 3:42:11 AM
Long-term archiving on: : Monday, May 12, 2014 - 1:51:15 PM

File

RR-2016-Consensus-optimal-V5.p...
Files produced by the author(s)

Licence


Distributed under a Creative Commons Attribution 4.0 International License

Identifiers

  • HAL Id : hal-00944019, version 2

Citation

Achour Mostefaoui, Moumen Hamouna, Michel Raynal. Signature-Free Asynchronous Byzantine Consensus with $t < n/3$ and $O(n^2)$ Messages. ACM PODC, Jul 2014, Paris, France. pp.2-9. ⟨hal-00944019v2⟩

Share

Metrics

Record views

3047

Files downloads

5457