2924 search results - page 519 / 585 » Lower Bounds in Distributed Computing |
155
Voted
PODC
2006
ACM
15 years 8 months ago
2006
ACM
Byzantine agreement algorithms typically assume implicit initial state consistency and synchronization among the correct nodes and then operate in coordinated rounds of informatio...
129
Voted
PODC
2004
ACM
15 years 8 months ago
2004
ACM
Group key exchange protocols allow a group of servers communicating over an asynchronous network of point-to-point links to establish a common key, such that an adversary which fu...
148
Voted
ESORICS
2010
Springer
15 years 3 months ago
2010
Springer
Fair exchange is one of the most fundamental problems in secure distributed computation. Alice has something that Bob wants, and Bob has something that Alice wants. A fair exchang...
129
Voted
SPAA
2010
ACM
15 years 2 months ago
2010
ACM
We study the communication complexity of rumor spreading in the random phone-call model. Suppose n players communicate in parallel rounds, where in each round every player calls a...
178
Voted
PODC
2012
ACM
13 years 5 months ago
2012
ACM
The goal of Byzantine Broadcast (BB) is to allow a set of fault-free nodes to agree on information that a source node wants to broadcast to them, in the presence of Byzantine faul...