Levels of authentication in distributed agreement

DOI10.1007/3-540-61769-8_4MaRDI QIDQ6570910zbMATH OpenFDO

Authors Malte Borcherding

Publication date 11 July 2024

Full work available at URL https://doi.org/10.1007/3-540-61769-8_4

zbMATH Keywords

authenticationByzantine agreementcrusader agreementdistributed systemsfault tolerance

Mathematics Subject Classification ID

Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• Authenticated Algorithms for Byzantine Agreement
• Byzantine Agreement Using Partial Authentication
• Fast Distributed Agreement
• On the number of authenticated rounds in Byzantine Agreement
• Bounds on information exchange for Byzantine agreement

Cites work

• A method for obtaining digital signatures and public-key cryptosystems
• Authenticated Algorithms for Byzantine Agreement
• Reaching Agreement in the Presence of Faults
• The Byzantine Generals Problem
• The Byzantine generals strike again
• The Failure Discovery problem

Cited in

(5)

• Concurrent asynchronous Byzantine agreement in expected-constant rounds, revisited
• Scalable agreement protocols with optimal optimistic efficiency
• Byzantine reliable broadcast and tendermint consensus with trusted components
• The bitcoin backbone protocol: analysis and applications
• Satrapy: from abstract to practical consensus for heterogeneous quorum systems

This page was built for publication: Levels of authentication in distributed agreement

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