148 search results - page 8 / 30 » Self-stabilization of Byzantine Protocols |
EUROSYS
2006
ACM
14 years 1 months ago
2006
ACM
This paper describes and evaluates Fireflies, a scalable protocol for supporting intrusion-tolerant network overlays.1 While such a protocol cannot distinguish Byzantine nodes fro...
WDAG
2007
Springer
14 years 3 months ago
2007
Springer
Byzantine-fault-tolerant service protocols like Q/U and FaB Paxos that optimistically order requests can provide increased efficiency and fault scalability. However, these protocol...
CORR
2008
Springer
13 years 10 months ago
2008
Springer
Consider an asynchronous system with private channels and n processes, up to t of which may be faulty. We settle a longstanding open question by providing a Byzantine agreement pr...
CRYPTO
2006
Springer
14 years 1 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...
PODC
2003
ACM
14 years 3 months ago
2003
ACM
This paper presents an efficient asynchronous protocol to compute RSA inverses with respect to a public RSA modulus N whose factorization is secret and shared among a group of pa...