284 search results - page 1 / 57 » Distributed Agreement with Optimal Communication Complexity |
SODA
2010
ACM
14 years 8 months ago
2010
ACM
We consider the problem of fault-tolerant agreement in a crash-prone synchronous system. We present a new randomized consensus algorithm that achieves optimal communication effici...
PODC
2009
ACM
14 years 11 months ago
2009
ACM
Consider a completely asynchronous network consisting of n parties where every two parties are connected by a private channel. An adversary At with unbounded computing power activ...
INFORMATICALT
2006
13 years 10 months ago
2006
Generally, the task in a distributed system must achieve an agreement. It requires a set of processors to agree on a common value even if some components are corrupted. There are s...
JSAC
2011
13 years 5 months ago
2011
—Due to the potential of enhancing traffic safety, protecting environment, and enabling new applications, vehicular communications, especially vehicle-to-vehicle (V2V) communica...
EUROCRYPT
2004
Springer
14 years 4 months ago
2004
Springer
We prove a tight lower bound for generic protocols for secure multicast key distribution where the messages sent by the group manager for rekeying the group are obtained by arbitra...