11 search results - page 2 / 3 » Complexity of Multi-Value Byzantine Agreement |
WDAG
2005
Springer
14 years 4 months ago
2005
Springer
Randomness is a critical resource in many computational scenarios, enabling solutions where deterministic ones are elusive or even provably impossible. However, the randomized solu...
DSN
2006
IEEE
14 years 4 months ago
2006
IEEE
Randomized agreement protocols have been around for more than two decades. Often assumed to be inefficient due to their high expected communication and time complexities, they ha...
ASIACRYPT
2010
Springer
13 years 8 months ago
2010
Springer
We consider the round complexity of a basic cryptographic task: verifiable secret sharing (VSS). This well-studied primitive provides a good "test case" for our understan...
ICDCS
2002
IEEE
14 years 3 months ago
2002
IEEE
In this paper, we focus our attention on the problem of automating the addition of failsafe fault-tolerance where fault-tolerance is added to an existing (fault-intolerant) progra...
TDSC
2011
13 years 5 months ago
2011
— Randomized agreement protocols have been around for more than two decades. Often assumed to be inefficient due to their high expected communication and computation complexitie...