Sciweavers

71 search results - page 4 / 15
» Anonymity in Probabilistic and Nondeterministic Systems
Sort
View
CCS
2007
ACM
14 years 14 days 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 13 days 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
TACAS
2000
Springer
138views Algorithms» more  TACAS 2000»
13 years 9 months ago
Symbolic Model Checking of Probabilistic Processes Using MTBDDs and the Kronecker Representation
This paper reports on experimental results with symbolic model checking of probabilistic processes based on Multi-Terminal Binary Decision Diagrams (MTBDDs). We consider concurrent...
Luca de Alfaro, Marta Z. Kwiatkowska, Gethin Norma...
QEST
2009
IEEE
14 years 1 months ago
Nondeterministic Labeled Markov Processes: Bisimulations and Logical Characterization
We extend the theory of labeled Markov processes with internal nondeterminism, a fundamental concept for the further development of a process theory with abstraction on nondetermi...
Pedro R. D'Argenio, Nicolás Wolovick, Pedro...
SEW
2006
IEEE
14 years 8 days ago
Integrating Probability with Time and Shared-Variable Concurrency
Complex software systems typically involve features like time, concurrency and probability, where probabilistic computations play an increasing role. It is challenging to formaliz...
Huibiao Zhu, Shengchao Qin, Jifeng He, Jonathan P....