Fast Byzantine leader election in dynamic networks

DOI10.1007/978-3-662-48653-5_19MaRDI QIDQ1664142zbMATH OpenOpenAlexFDO

Authors Gopal Pandurangan, Peter Robinson, John Augustine

Publication date 24 August 2018

Full work available at URL https://pureadmin.qub.ac.uk/ws/files/16747696/disc.pdf

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Distributed systems (68M14) Network protocols (68M12)

Recommendations

• Fast Byzantine agreement in dynamic networks
• Leader election in sparse dynamic networks with churn
• Fast asynchronous Byzantine agreement and leader election with full information
• Self-stabilizing leader election in dynamic networks
• From Almost Everywhere to Everywhere: Byzantine Agreement with $\tilde{O}(n^{3/2})$ Bits

Cited in

(13)

• Leader election in well-connected graphs
• Distributed agreement in dynamic peer-to-peer networks
• Distributed computation of exact average degree and network size in finite time under quantized communication
• Be aware of your leaders
• Resource Burning for Permissionless Systems (Invited Paper)
• Leader election in sparse dynamic networks with churn
• Fast Byzantine agreement in dynamic networks
• Some lower bounds in dynamic networks with oblivious adversaries
• scientific article; zbMATH DE number 88976 (Why is no real title available?)
• Towards robust and efficient computation in dynamic peer-to-peer networks
• Highly dynamic distributed computing with Byzantine failures
• Brahms: Byzantine resilient random membership sampling
• Bankrupting Sybil despite churn

This page was built for publication: Fast Byzantine leader election in dynamic networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1664142)