Search
Now showing items 31-40 of 40
Consensus using Asynchronous Failure Detectors
(2015-03-02)
The FLP result shows that crash-tolerant consensus is impossible to solve in asynchronous systems, and several solutions have been proposed for crash-tolerant consensus under alternative (stronger) models. One popular ...
The Abstract MAC Layer
(2009-02-21)
A diversity of possible communication assumptions complicates the study of algorithms and lower bounds for radio networks. We address this problem by defining an Abstract MAC Layer. This service provides reliable local ...
Asynchronous Failure Detectors
(2013-10-10)
Failure detectors -- oracles that provide information about process crashes -- are an important abstraction for crash tolerance in distributed systems. The generality of failure-detector theory, while providing great ...
Using Task-Structured Probabilistic I/O Automata to Analyze an Oblivious Transfer Protocol
(2007-02-16)
The Probabilistic I/O Automata framework of Lynch, Segala and Vaandrager provides tools for precisely specifying protocols and reasoning about their correctness using multiple levels of abstraction, based on implementation ...
Using Task-Structured Probabilistic I/O Automata to Analyze an Oblivious Transfer Protocol
(2006-06-20)
The Probabilistic I/O Automata framework of Lynch, Segala and Vaandrager provides tools for precisely specifying protocols and reasoning about theircorrectness using multiple levels of abstraction, based on implementation ...
Using Task-Structured Probabilistic I/O Automata to Analyze an Oblivious Transfer Protocol
(2006-03-08)
AbstractThe Probabilistic I/O Automata framework of Lynch, Segala and Vaandrager provides tools for precisely specifying protocols and reasoning about their correctness using multiple levels of abstraction, based on ...
Using Probabilistic I/O Automata to Analyze an Oblivious Transfer Protocol
(2006-06-19)
We demonstrate how to carry out cryptographic security analysis ofdistributed protocols within the Probabilistic I/O Automataframework of Lynch, Segala, and Vaandrager. This framework providestools for arguing rigorously ...
Using Probabilistic I/O Automata to Analyze an Oblivious Transfer Protocol
(2005-08-19)
We demonstrate how to carry out cryptographic security analysis ofdistributed protocols within the Probabilistic I/O Automata frameworkof Lynch, Segala, and Vaandrager.This framework provides tools for arguing rigorously ...
Proving Atomicity: An Assertional Approach
(2005-07-22)
Atomicity (or linearizability) is a commonly used consistency criterion for distributed services and objects. Although atomic object implementations are abundant, proving that algorithms achieve atomicity has turned out ...
Self-Stabilizing Mobile Node Location Management and Message
(2005-08-11)
We present simple algorithms for achieving self-stabilizing locationmanagement and routing in mobile ad-hoc networks. While mobile clients maybe susceptible to corruption and stopping failures, mobile networks areoften ...