Sciweavers

15 search results - page 3 / 3
» Simple Circuits that Work for Complicated Reasons
Sort
View
USS
2004
13 years 7 months ago
Tor: The Second-Generation Onion Router
We present Tor, a circuit-based low-latency anonymous communication service. This second-generation Onion Routing system addresses limitations in the original design by adding per...
Roger Dingledine, Nick Mathewson, Paul F. Syverson
SRDS
2006
IEEE
13 years 11 months ago
Solving Consensus Using Structural Failure Models
Failure models characterise the expected component failures in fault-tolerant computing. In the context of distributed systems, a failure model usually consists of two parts: a fu...
Timo Warns, Felix C. Freiling, Wilhelm Hasselbring
SIGCOMM
2010
ACM
13 years 6 months ago
Predictable 802.11 packet delivery from wireless channel measurements
RSSI is known to be a fickle indicator of whether a wireless link will work, for many reasons. This greatly complicates operation because it requires testing and adaptation to fin...
Daniel Halperin, Wenjun Hu, Anmol Sheth, David Wet...
POPL
2001
ACM
14 years 6 months ago
Mobile values, new names, and secure communication
We study the interaction of the "new" construct with a rich but common form of (first-order) communication. This interaction is crucial in security protocols, which are ...
Cédric Fournet, Martín Abadi
LATA
2010
Springer
13 years 9 months ago
Variable Automata over Infinite Alphabets
Automated reasoning about systems with infinite domains requires an extension of regular automata to infinite alphabets. Existing formalisms of such automata cope with the infinite...
Sarai Sheinvald, Orna Grumberg, Orna Kupferman