scientific article; zbMATH DE number 1154413

MaRDI QIDQ4389722zbMATH OpenFDO

Authors Malte Borcherding

Publication date 22 May 1998

zbMATH Keywords

agreementprotocolsByzantineauthentification

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to computer science (68-02) Reliability, testing and fault tolerance of networks and computer systems (68M15) Network design and communication in computer systems (68M10)

Recommendations

• scientific article; zbMATH DE number 7774289
• Authenticated Algorithms for Byzantine Agreement
• On the composition of authenticated Byzantine Agreement
• On the Number of Synchronous Rounds Sufficient for Authenticated Byzantine Agreement
• On the number of authenticated rounds in Byzantine Agreement
• Efficient algorithms for anonymous Byzantine agreement
• Byzantine Agreement Using Partial Authentication
• Optimal communication complexity of authenticated Byzantine agreement
• scientific article; zbMATH DE number 1973984
• A hybrid protocol to solve authenticated Byzantine consensus

Cited in

(3)

• On the composition of authenticated Byzantine Agreement
• Byzantine Agreement Using Partial Authentication
• scientific article; zbMATH DE number 7774289 (Why is no real title available?)

This page was built for publication:

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