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

Full description

Saved in:

Bibliographic Details
Published in:	Distributed computing Vol. 28; no. 6; pp. 377 - 389
Main Authors:	Lewko, Allison, Lewko, Mark
Format:	Journal Article
Language:	English
Published:	Berlin/Heidelberg Springer Berlin Heidelberg 01.12.2015 Springer Nature B.V
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!