Summary
Gradecast is a simple three-round algorithm presented by Feldman and Micali [4]. The current work presents two very simple algorithms that utilize Gradecast to achieve Byzantine agreement and to solve the Approximate agreement problem [2].
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Ben-Or, M., Dolev, D., Hoch, E.N.: Simple gradecast based algorithms. CoRR, abs/1007.1049 (2010)
Dolev, D., Lynch, N.A., Stark, E., Weihl, W.E., Pinter, S.: Reaching approximate agreement in the presence of faults. J. of the ACM 33, 499–516 (1986)
Fekete, A.D.: Asymptotically optimal algorithms for approximate agreement. In: PODC ’86, pp. 73–87. ACM, New York (1986)
Feldman, P., Micali, S.: Optimal algorithms for byzantine agreement. In: STOC ’88, pp. 148–161. ACM, New York (1988)
Zamsky, A.: Phd thesis (October 1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ben-Or, M., Dolev, D., Hoch, E.N. (2010). Brief Announcement: Simple Gradecast Based Algorithms. In: Lynch, N.A., Shvartsman, A.A. (eds) Distributed Computing. DISC 2010. Lecture Notes in Computer Science, vol 6343. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15763-9_18
Download citation
DOI: https://doi.org/10.1007/978-3-642-15763-9_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-15762-2
Online ISBN: 978-3-642-15763-9
eBook Packages: Computer ScienceComputer Science (R0)