Sciweavers

9 search results - page 1 / 2
» Randomized Intrusion-Tolerant Asynchronous Services
Sort
View
DSN
2006
IEEE
13 years 11 months ago
Randomized Intrusion-Tolerant Asynchronous Services
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...
Henrique Moniz, Nuno Ferreira Neves, Miguel Correi...
TDSC
2011
13 years 2 days ago
RITAS: Services for Randomized Intrusion Tolerance
— 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...
Henrique Moniz, Nuno Ferreira Neves, Miguel Correi...
OPODIS
2010
13 years 3 months ago
Signature-Free Broadcast-Based Intrusion Tolerance: Never Decide a Byzantine Value
: Provide application processes with strong agreement guarantees despite failures is a fundamental problem of fault-tolerant distributed computing. Correct processes have not to be...
Achour Mostéfaoui, Michel Raynal
DSN
2002
IEEE
13 years 10 months ago
Secure Intrusion-tolerant Replication on the Internet
This paper describes a Secure INtrusion-Tolerant Replication Architecture1 (SINTRA) for coordination in asynchronous networks subject to Byzantine faults. SINTRA supplies a number...
Christian Cachin, Jonathan A. Poritz
LCPC
2007
Springer
13 years 11 months ago
A Novel Asynchronous Software Cache Implementation for the Cell-BE Processor
This paper describes the implementation of a runtime library for asynchronous communication in the Cell BE processor. The runtime library implementation provides with several servi...
Jairo Balart, Marc González, Xavier Martore...