Brief announcement: Simple gradecast based algorithms

Michael Ben-Or; Danny Dolev; Ezra N. Hoch

doi:10.1007/978-3-642-15763-9_18

Brief announcement: Simple gradecast based algorithms

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

^*Corresponding author for this work

The Rachel and Selim Benin School of Engineering and Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

8 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 language	English
Title of host publication	Distributed Computing - 24th International Symposium, DISC 2010, Proceedings
Pages	194-197
Number of pages	4
DOIs	https://doi.org/10.1007/978-3-642-15763-9_18
State	Published - 2010
Event	24th International Symposium on Distributed Computing, DISC 2010 - Cambridge, MA, United States Duration: 13 Sep 2010 → 15 Sep 2010

Publication series

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

Conference

Conference	24th International Symposium on Distributed Computing, DISC 2010
Country/Territory	United States
City	Cambridge, MA
Period	13/09/10 → 15/09/10

Access to Document

10.1007/978-3-642-15763-9_18

Cite this

Ben-Or, M., Dolev, D., & Hoch, E. N. (2010). Brief announcement: Simple gradecast based algorithms. In Distributed Computing - 24th International Symposium, DISC 2010, Proceedings (pp. 194-197). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6343 LNCS). https://doi.org/10.1007/978-3-642-15763-9_18

@inproceedings{ad6a1075a77844888f7734c8db987366,

title = "Brief announcement: Simple gradecast based algorithms",

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

author = "Michael Ben-Or and Danny Dolev and Hoch, {Ezra N.}",

year = "2010",

doi = "10.1007/978-3-642-15763-9_18",

language = "אנגלית",

isbn = "3642157629",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

pages = "194--197",

booktitle = "Distributed Computing - 24th International Symposium, DISC 2010, Proceedings",

note = "24th International Symposium on Distributed Computing, DISC 2010 ; Conference date: 13-09-2010 Through 15-09-2010",

}

Ben-Or, M, Dolev, D & Hoch, EN 2010, Brief announcement: Simple gradecast based algorithms. in Distributed Computing - 24th International Symposium, DISC 2010, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 6343 LNCS, pp. 194-197, 24th International Symposium on Distributed Computing, DISC 2010, Cambridge, MA, United States, 13/09/10. https://doi.org/10.1007/978-3-642-15763-9_18

Brief announcement: Simple gradecast based algorithms. / Ben-Or, Michael; Dolev, Danny; Hoch, Ezra N.
Distributed Computing - 24th International Symposium, DISC 2010, Proceedings. 2010. p. 194-197 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6343 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Brief announcement

T2 - 24th International Symposium on Distributed Computing, DISC 2010

AU - Ben-Or, Michael

AU - Dolev, Danny

AU - Hoch, Ezra N.

PY - 2010

Y1 - 2010

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

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

UR - http://www.scopus.com/inward/record.url?scp=78649841420&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-15763-9_18

DO - 10.1007/978-3-642-15763-9_18

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:78649841420

SN - 3642157629

SN - 9783642157622

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 194

EP - 197

BT - Distributed Computing - 24th International Symposium, DISC 2010, Proceedings

Y2 - 13 September 2010 through 15 September 2010

ER -

Brief announcement: Simple gradecast based algorithms

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this