Expected linear round synchronization: the missing link for linear Byzantine SMR

DOI10.1007/s00446-023-00459-9arXiv2002.07539MaRDI QIDQ6126136

Idit Keidar, Oded Naor

Publication date: 9 April 2024

Published in: Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2002.07539

zbMATH Keywords

distributed systemsstate machine replication

Mathematics Subject Classification ID

Distributed systems (68M14) Distributed algorithms (68W15)

Cites Work

• Unnamed Item
• Unnamed Item
• Asynchronous byzantine agreement protocols
• On the power of randomization in on-line algorithms
• Asynchronous Byzantine agreement with subquadratic communication
• Random oracles in Constantinople: Practical asynchronous Byzantine agreement using cryptography
• Round-by-round fault detectors (extended abstract)
• Born and raised distributively
• Complexity of network synchronization
• Competitive paging algorithms
• An optimal on-line algorithm for metrical task system
• Asymptotically Optimal Validated Asynchronous Byzantine Agreement
• Timeliness, failure-detectors, and consensus performance
• Jolteon and Ditto: network-adaptive efficient consensus with asynchronous fallback

This page was built for publication: Expected linear round synchronization: the missing link for linear Byzantine SMR