10 search results - page 1 / 2 » On the composition of authenticated byzantine agreement |
STOC
2002
ACM
14 years 5 months ago
2002
ACM
A fundamental problem of distributed computing is that of simulating a secure broadcast channel, within the setting of a point-to-point network. This problem is known as Byzantine...
CRYPTO
2006
Springer
13 years 8 months ago
2006
Springer
In a seminal paper, Feldman and Micali (STOC '88) show an n-party Byzantine agreement protocol tolerating t < n/3 malicious parties that runs in expected constant rounds. H...
FSTTCS
1997
Springer
13 years 9 months ago
1997
Springer
We illustrate in this paper a compositional and stepwise method for designing programs that o er a potentially unique tolerance to each of their fault-classes. More speci cally, o...
ETRICS
2006
13 years 8 months ago
2006
One of the main advantages of peer-to-peer (P2P) systems is their capability to offer replicas of the same content at various locations. This allows to access contents even when so...
SPAA
2010
ACM
13 years 9 months ago
2010
ACM
In this work, we address Byzantine agreement in a message passing system with homonyms, i.e. a system with a number l of authenticated identities that is independent of the total ...