Sciweavers

198 search results - page 3 / 40
» Weak Probabilistic Anonymity
Sort
View
TCS
2010
13 years 3 months ago
Weak bisimulation for Probabilistic Timed Automata
We are interested in describing timed systems that exhibit probabilistic behaviour. To this purpose, we consider a model of Probabilistic Timed Automata and introduce a concept of ...
Ruggero Lanotte, Andrea Maggiolo-Schettini, Angelo...
ENTCS
2006
134views more  ENTCS 2006»
13 years 9 months ago
Anonymity in Probabilistic and Nondeterministic Systems
Anonymity means that the identity of the user performing a certain action is maintained secret. The protocols for ensuring anonymity often use random mechanisms which can be descr...
Catuscia Palamidessi
ENTCS
2007
126views more  ENTCS 2007»
13 years 9 months ago
Notes on Generative Probabilistic Bisimulation
In this notes we consider the model of Generative Probabilistic Transition Systems, and Baier and Hermanns’ notion of weak bisimulation defined over them. We prove that, if we ...
Simone Tini
IFIP
2005
Springer
14 years 2 months ago
On Anonymity with Identity Escrow
Anonymity with identity escrow attempts to allow users of a service to remain anonymous, while providing the possibility that the service owner can break the anonymity in exception...
Aybek Mukhamedov, Mark Dermot Ryan
IH
1998
Springer
14 years 1 months ago
Stop-and-Go-MIXes Providing Probabilistic Anonymity in an Open System
Abstract. Currently knownbasic anonymitytechniques dependon identity veri cation. If veri cation of user identities is not possible due to the related management overhead or a gene...
Dogan Kesdogan, Jan Egner, Roland Büschkes