18 search results - page 3 / 4 » Authenticated Byzantine Generals in Dual Failure Model |
PODC
2006
ACM
13 years 11 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...
SPAA
2010
ACM
13 years 10 months ago
2010
ACM
This paper studies non-cryptographic authenticated broadcast in radio networks subject to malicious failures. We introduce two protocols that address this problem. The first, Nei...
SOSP
2001
ACM
14 years 2 months ago
2001
ACM
ing Abstraction to Improve Fault Tolerance MIGUEL CASTRO Microsoft Research and RODRIGO RODRIGUES and BARBARA LISKOV MIT Laboratory for Computer Science Software errors are a major...
GLOBECOM
2007
IEEE
13 years 11 months ago
2007
IEEE
—To understand how node mobility and Byzantine node failures affect connectivity of wireless multi-hop networks, this paper investigates resilience of geometric random graphs to ...
TSE
2002
13 years 4 months ago
2002
This paper presents a new approach to software reliability modeling by grouping data into clusters of homogeneous failure intensities. This series of data clusters associated with...