Sciweavers

60 search results - page 12 / 12
» Self-stabilizing byzantine agreement
Sort
View
ICDCS
2002
IEEE
13 years 10 months ago
The Complexity of Adding Failsafe Fault-Tolerance
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...
Sandeep S. Kulkarni, Ali Ebnenasir
TSE
1998
102views more  TSE 1998»
13 years 4 months ago
Designing Masking Fault-Tolerance via Nonmasking Fault-Tolerance
—Masking fault-tolerance guarantees that programs continually satisfy their specification in the presence of faults. By way of contrast, nonmasking fault-tolerance does not guara...
Anish Arora, Sandeep S. Kulkarni
EUROSYS
2007
ACM
14 years 2 months ago
Antiquity: exploiting a secure log for wide-area distributed storage
Antiquity is a wide-area distributed storage system designed to provide a simple storage service for applications like file systems and back-up. The design assumes that all serve...
Hakim Weatherspoon, Patrick R. Eaton, Byung-Gon Ch...
ICDCS
2003
IEEE
13 years 10 months ago
Enhancing The Fault-Tolerance of Nonmasking Programs
In this paper, we focus on automated techniques to enhance the fault-tolerance of a nonmasking fault-tolerant program to masking. A masking program continually satisfies its spec...
Sandeep S. Kulkarni, Ali Ebnenasir
ESORICS
2010
Springer
13 years 6 months ago
Optimistic Fair Exchange with Multiple Arbiters
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...
Alptekin Küpçü, Anna Lysyanskaya