Sciweavers

1599 search results - page 18 / 320
» Probabilistic Analysis of Anonymity
Sort
View
SIROCCO
2010
13 years 8 months ago
Optimal Deterministic Ring Exploration with Oblivious Asynchronous Robots
We consider the problem of exploring an anonymous unoriented ring of size n by k identical, oblivious, asynchronous mobile robots, that are unable to communicate, yet have the abil...
Anissa Lamani, Maria Gradinariu Potop-Butucaru, S&...
ESORICS
2004
Springer
14 years 3 months ago
Comparison Between Two Practical Mix Designs
We evaluate the anonymity provided by two popular email mix implementations, Mixmaster and Reliable, and compare their effectiveness through the use of simulations which model th...
Claudia Díaz, Len Sassaman, Evelyne Dewitte
QEST
2009
IEEE
14 years 4 months ago
Safety Analysis of an Airbag System Using Probabilistic FMEA and Probabilistic Counterexamples
—Failure mode and effects analysis (FMEA) is a technique to reason about possible system hazards that result from system or system component failures. Traditionally, FMEA does no...
Husain Aljazzar, Manuel Fischer, Lars Grunske, Mat...
SP
2008
IEEE
103views Security Privacy» more  SP 2008»
14 years 4 months ago
Preserving Caller Anonymity in Voice-over-IP Networks
— Applications such as VoIP need to provide anonymity to clients while maintaining low latency to satisfy quality of service (QoS) requirements. Existing solutions for providing ...
Mudhakar Srivatsa, Ling Liu, Arun Iyengar
CCS
2005
ACM
14 years 3 months ago
Provable anonymity
This paper provides a formal framework for the analysis of information hiding properties of anonymous communication protocols in terms of epistemic logic. The key ingredient is ou...
Flavio D. Garcia, Ichiro Hasuo, Wolter Pieters, Pe...