On the number of authenticated rounds in Byzantine Agreement | Zendy

Malte Borcherding | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

On the number of authenticated rounds in Byzantine Agreement

Author(s) -

Malte Borcherding

Publication year - 1995

Publication title -

lecture notes in computer science

Language(s) - English

Resource type - Book series

SCImago Journal Rank - 0.249

H-Index - 400

eISSN - 1611-3349

pISSN - 0302-9743

ISBN - 3-540-60274-7

DOI - 10.1007/bfb0022150

Subject(s) - computer science , communication source , node (physics) , byzantine fault tolerance , computer network , protocol (science) , set (abstract data type) , class (philosophy) , fault tolerance , distributed computing , artificial intelligence , medicine , alternative medicine , structural engineering , pathology , engineering , programming language

Byzantine Agreement requires a set of nodes in a distributed system to agree on the message of a sender despite the presence of arbitrarily faulty nodes. Solutions for this problem are generally divided into two classes: authenticated protocols and non-authenticated protocols. In the former class, all messages are (digitally) signed and can be assigned to their respective signers, while in the latter no messages are signed. Authenticated protocols can tolerate an arbitrary number of faults, while non-authenticated protocols require more than two thirds of the nodes to be correct.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research