Cites work
- Asynchronous byzantine agreement protocols
- Asynchronous Byzantine agreement with optimal resilience
- Byzantine disk paxos: optimal resilience with Byzantine shared memory
- Byzantine quorum systems
- Efficient and Adaptively Secure Asynchronous Binary Agreement via Binding Crusader Agreement
- Fast asynchronous Byzantine agreement with optimal resilience
- HotStuff
- How to assign votes in a distributed system
- scientific article; zbMATH DE number 996442 (Why is no real title available?)
- scientific article; zbMATH DE number 4179276 (Why is no real title available?)
- scientific article; zbMATH DE number 7774302 (Why is no real title available?)
- Introduction to Reliable and Secure Distributed Programming
- On interprocess communication. I: Basic formalism
- Player simulation and general adversary structures in perfect multiparty computation
- Random oracles in Constantinople: Practical asynchronous Byzantine agreement using cryptography
- Reaching Agreement in the Presence of Faults
- Secure Protocols with Asymmetric Trust
- Signature-free asynchronous binary Byzantine consensus with \(t<n/3\), \(O(n^2)\) messages, and \(O(1)\) expected time
- Stellar consensus by instantiation
- The Load, Capacity, and Availability of Quorum Systems
- Threshold protocols in survivor set systems
Cited in
(2)
This page was built for publication: Asymmetric distributed trust
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6601210)
