Brief announcement: Simple gradecast based algorithms

Michael Ben-Or*, Danny Dolev, Ezra N. Hoch

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

7 Scopus citations

Abstract

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].

Original languageAmerican English
Title of host publicationDistributed Computing - 24th International Symposium, DISC 2010, Proceedings
Pages194-197
Number of pages4
DOIs
StatePublished - 2010
Event24th International Symposium on Distributed Computing, DISC 2010 - Cambridge, MA, United States
Duration: 13 Sep 201015 Sep 2010

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume6343 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference24th International Symposium on Distributed Computing, DISC 2010
Country/TerritoryUnited States
CityCambridge, MA
Period13/09/1015/09/10

Fingerprint

Dive into the research topics of 'Brief announcement: Simple gradecast based algorithms'. Together they form a unique fingerprint.

Cite this