Sciweavers

46 search results - page 6 / 10
» Probabilistic Anonymity
Sort
View
93
Voted
SIROCCO
2010
14 years 10 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&...
FC
2008
Springer
90views Cryptology» more  FC 2008»
15 years 1 months ago
Practical Anonymous Divisible E-Cash from Bounded Accumulators
We present an efficient off-line divisible e-cash scheme which is truly anonymous without a trusted third party. This is the second scheme in the literature which achieves full unl...
Man Ho Au, Willy Susilo, Yi Mu
79
Voted
IFIP
2005
Springer
15 years 5 months ago
Probable Innocence Revisited
In this paper we propose a formalization of probable innocence, a notion of probabilistic anonymity that is associated to “realistic” protocols such as Crowds. We analyze crit...
Konstantinos Chatzikokolakis, Catuscia Palamidessi
104
Voted
CCS
2009
ACM
15 years 3 months ago
The bayesian traffic analysis of mix networks
This work casts the traffic analysis of anonymity systems, and in particular mix networks, in the context of Bayesian inference. A generative probabilistic model of mix network ar...
Carmela Troncoso, George Danezis
IFIP
2010
Springer
14 years 6 months ago
Reasoning about Probabilistic Security Using Task-PIOAs
Abstract. Task-structured probabilistic input/output automata (taskPIOAs) are concurrent probabilistic automata that, among other things, have been used to provide a formal framewo...
Aaron D. Jaggard, Catherine Meadows, Michael Mislo...