Sciweavers

376 search results - page 62 / 76
» Self-Stabilizing Graph Protocols
Sort
View
LICS
2003
IEEE
14 years 2 months ago
Model checking for probability and time: from theory to practice
Probability features increasingly often in software and hardware systems: it is used in distributed co-ordination and routing problems, to model fault-tolerance and performance, a...
Marta Z. Kwiatkowska
ESEC
1997
Springer
14 years 29 days ago
Verification of Liveness Properties Using Compositional Reachability Analysis
The software architecture of a distributed program can be represented by a hierarchical composition of subsystems, with interacting processes at the leaves of the hierarchy. Compo...
Shing-Chi Cheung, Dimitra Giannakopoulou, Jeff Kra...
CRYPTO
2006
Springer
159views Cryptology» more  CRYPTO 2006»
14 years 16 days ago
Asymptotically Optimal Two-Round Perfectly Secure Message Transmission
Abstract. The problem of perfectly secure message transmission concerns two synchronized non-faulty processors sender (S) and receiver (R) that are connected by a synchronous netwo...
Saurabh Agarwal, Ronald Cramer, Robbert de Haan
PKC
2000
Springer
120views Cryptology» more  PKC 2000»
14 years 11 days ago
Optimally Efficient Accountable Time-Stamping
Abstract. Efficient secure time-stamping schemes employ a 2-level approach in which the time-stamping service operates in rounds. We say that a time-stamping service is accountable...
Ahto Buldas, Helger Lipmaa, Berry Schoenmakers
DCOSS
2010
Springer
14 years 3 days ago
Wormholes No More? Localized Wormhole Detection and Prevention in Wireless Networks
A number of protocols have been proposed to date to defend against wormhole attacks in wireless networks by adopting synchronized clocks, positioning devices, or directional antenn...
Tassos Dimitriou, Thanassis Giannetsos