Repository logo

Infoscience

  • English
  • French
Log In
Logo EPFL, École polytechnique fédérale de Lausanne

Infoscience

  • English
  • French
Log In
  1. Home
  2. Academic and Research Output
  3. Conferences, Workshops, Symposiums, and Seminars
  4. A Leader-Free Byzantine Consensus Algorithm
 
conference paper

A Leader-Free Byzantine Consensus Algorithm

Borran, Fatemeh  
•
Schiper, André  
2010
Proceedings of the 11th International Conference on Distributed Computing and Networking (ICDCN)
11th International Conference on Distributed Computing and Networking (ICDCN)

The paper considers the consensus problem in a partially synchronous system with Byzantine faults. It turns out that, in the partially synchronous system, all deterministic algorithms that solve consensus with Byzantine faults are leader-based. This is not the case of benign faults, which raises the following fundamental question: is it possible to design a deterministic Byzantine consensus algorithm for a partially synchronous system that is not leader-based? The paper gives a positive answer to this question, and presents a leader-free algorithm that is resilient-optimal and signature-free.

  • Files
  • Details
  • Metrics
Loading...
Thumbnail Image
Name

LeaderFree.pdf

Access type

openaccess

Size

204.16 KB

Format

Adobe PDF

Checksum (MD5)

cf37c6313e9f8c9056e5281827021b8e

Logo EPFL, École polytechnique fédérale de Lausanne
  • Contact
  • infoscience@epfl.ch

  • Follow us on Facebook
  • Follow us on Instagram
  • Follow us on LinkedIn
  • Follow us on X
  • Follow us on Youtube
AccessibilityLegal noticePrivacy policyCookie settingsEnd User AgreementGet helpFeedback

Infoscience is a service managed and provided by the Library and IT Services of EPFL. © EPFL, tous droits réservés