Scalable and secure computation among strangers: message-competitive Byzantine protocols
DOI10.4230/LIPICS.DISC.2020.31zbMATH Open1540.68024MaRDI QIDQ6535030
John Augustine, Valerie King, Gopal Pandurangan, Anisur Rahaman Molla, Jared Saia
Publication date: 2 November 2023
leader electionByzantine agreementByzantine protocolsrandomized protocolcommittee electionmessage-competitive protocol
Network design and communication in computer systems (68M10) Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15) Network protocols (68M12) Distributed algorithms (68W15)
Cites Work
- Title not available (Why is that?)
- Interactive communication with unknown noise rate
- Probability and computing. Randomization and probabilistic techniques in algorithms and data analysis
- Byzantine agreement in the full-information model in O(log n) rounds
- Making evildoers pay
- Conflict on a communication channel
- Scalable leader election
- Bounds on information exchange for Byzantine agreement
- Reaching Agreement in the Presence of Faults
- Message-optimal protocols for Byzantine Agreement
- Distributed Computing: A Locality-Sensitive Approach
- How to Scale Exponential Backoff: Constant Throughput, Polylog Access Attempts, and Robustness
- Communication Complexity of Byzantine Agreement, Revisited
- Fast byzantine agreement
- Synchronous byzantine agreement with nearly a cubic number of communication bits
- Breaking the O ( n 2 ) bit barrier
Related Items (1)
This page was built for publication: Scalable and secure computation among strangers: message-competitive Byzantine protocols
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6535030)
