198 search results - page 22 / 40 » Weak Probabilistic Anonymity |
FOSSACS
2009
Springer
14 years 3 months ago
2009
Springer
Bisimulation between processes has been proven a successful method for formalizing security properties. We argue that in certain cases, a scheduler that has full information on the...
PET
2009
Springer
14 years 3 months ago
2009
Springer
We present the Vida family of abstractions of anonymous communication systems, model them probabilistically and apply Bayesian inference to extract patterns of communications and u...
P2P
2008
IEEE
14 years 3 months ago
2008
IEEE
We introduce transaction rate limiters, new mechanisms that limit (probabilistically) the maximum number of transactions a user of a peer-to-peer system can do in any given period...
SIGCOMM
2000
ACM
14 years 1 months ago
2000
ACM
This paper describes a technique for tracing anonymous packet flooding attacks in the Internet back towards their source. This work is motivated by the increased frequency and so...
EUROCRYPT
2008
Springer
13 years 11 months ago
2008
Springer
A shuffle of a set of ciphertexts is a new set of ciphertexts with the same plaintexts in permuted order. Shuffles of homomorphic encryptions are a key component in mix-nets, whic...