On the complexity of asynchronous agreement against powerful adversaries

We introduce new techniques for proving lower bounds on the running time of randomized algorithms for asynchronous agreement against powerful adversaries. In particular, we define a strongly adaptive adversary that is computationally unbounded and has a limited ability to corrupt a dynamic subset of...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Distributed computing Jg. 28; H. 6; S. 377 - 389
Hauptverfasser:	Lewko, Allison, Lewko, Mark
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Berlin/Heidelberg Springer Berlin Heidelberg 01.12.2015 Springer Nature B.V
Schlagworte:	Adaptive algorithms Algorithms Computer Communication Networks Computer Hardware Computer Science Computer Systems Organization and Communication Networks Crashes Expenses Failure Lower bounds Processors Running Software Engineering/Programming and Operating Systems Theory of Computation Partial Execution Byzantine Agreement Faulty Processor Crash Failure Message Buffer
ISSN:	0178-2770, 1432-0452
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!