Sciweavers

198 search results - page 5 / 40
» Weak Probabilistic Anonymity
Sort
View
ICDCS
2008
IEEE
14 years 3 months ago
Weak vs. Self vs. Probabilistic Stabilization
Self-stabilization is a strong property which guarantees that a network always resume a correct behavior starting from an arbitrary initial state. Weaker guarantees have later bee...
Stéphane Devismes, Sébastien Tixeuil...
CSFW
2002
IEEE
14 years 2 months ago
Probabilistic Analysis of Anonymity
We present a formal analysis technique for probabilistic security properties of peer-to-peer communication systems based on random message routing among members. The behavior of g...
Vitaly Shmatikov
CCS
2007
ACM
14 years 3 months ago
Denial of service or denial of security?
We consider the effect attackers who disrupt anonymous communications have on the security of traditional high- and low-latency anonymous communication systems, as well as on the...
Nikita Borisov, George Danezis, Prateek Mittal, Pa...
ISI
2007
Springer
14 years 3 months ago
A Combinatorial Approach to Measuring Anonymity
— In this paper we define a new metric for quantifying the degree of anonymity collectively afforded to users of an anonymous communication system. We show how our metric, based...
Matthew Edman, Fikret Sivrikaya, Bülent Yener
JUCS
2006
124views more  JUCS 2006»
13 years 9 months ago
Variations on Itai-Rodeh Leader Election for Anonymous Rings and their Analysis in PRISM
Abstract: We present two probabilistic leader election algorithms for anonymous unidirectional rings with FIFO channels, based on an algorithm from Itai and Rodeh [Itai and Rodeh 1...
Wan Fokkink, Jun Pang