Sciweavers

97 search results - page 2 / 20
» Some Timestamping Protocol Failures
Sort
View
CONCUR
2005
Springer
13 years 10 months ago
Timed Spi-Calculus with Types for Secrecy and Authenticity
Abstract. We present a discretely timed spi-calculus. A primitive for key compromise allows us to model key compromise attacks, thus going beyond the standard Dolev–Yao attacker ...
Christian Haack, Alan Jeffrey
ICDCS
2005
IEEE
13 years 11 months ago
Optimal Asynchronous Garbage Collection for RDT Checkpointing Protocols
Communication-induced checkpointing protocols that ensure rollback-dependency trackability (RDT) guarantee important properties to the recovery system without explicit coordinatio...
Rodrigo Schmidt, Islene C. Garcia, Fernando Pedone...
ICISC
2008
89views Cryptology» more  ICISC 2008»
13 years 6 months ago
Survival in the Wild: Robust Group Key Agreement in Wide-Area Networks
Group key agreement (GKA) allows a set of players to establish a shared secret and thus bootstrap secure group communication. GKA is very useful in many types of peer group scenar...
Jihye Kim, Gene Tsudik
DEDS
2000
104views more  DEDS 2000»
13 years 5 months ago
Coordinated Decentralized Protocols for Failure Diagnosis of Discrete Event Systems
We address the problem of failure diagnosis in discrete event systems with decentralized information. We propose a coordinated decentralized architecture consisting of local sites ...
Rami Debouk, Stéphane Lafortune, Demostheni...
JACM
2000
77views more  JACM 2000»
13 years 5 months ago
The fault span of crash failures
A crashing network protocol is an asynchronous protocol whose memory does not survive crashes. We show that a crashing network protocol that works over unreliable links can be driv...
George Varghese, Mahesh Jayaram