A filtering algorithm for constraints of difference in CSPs
AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
Untraceable electronic mail, return addresses, and digital pseudonyms
Communications of the ACM
Limits of Anonymity in Open Environments
IH '02 Revised Papers from the 5th International Workshop on Information Hiding
Probabilistic Treatment of MIXes to Hamper Traffic Analysis
SP '03 Proceedings of the 2003 IEEE Symposium on Security and Privacy
Information Theory, Inference & Learning Algorithms
Information Theory, Inference & Learning Algorithms
Probability of Error in Information-Hiding Protocols
CSF '07 Proceedings of the 20th IEEE Computer Security Foundations Symposium
Probabilistic analysis of an anonymity system
Journal of Computer Security - Special issue on CSFW15
Robust De-anonymization of Large Sparse Datasets
SP '08 Proceedings of the 2008 IEEE Symposium on Security and Privacy
Perfect Matching Disclosure Attacks
PETS '08 Proceedings of the 8th international symposium on Privacy Enhancing Technologies
On the Impact of Social Network Profiling on Anonymity
PETS '08 Proceedings of the 8th international symposium on Privacy Enhancing Technologies
Towards an information theoretic metric for anonymity
PET'02 Proceedings of the 2nd international conference on Privacy enhancing technologies
PET'02 Proceedings of the 2nd international conference on Privacy enhancing technologies
Two-sided statistical disclosure attack
PET'07 Proceedings of the 7th international conference on Privacy enhancing technologies
Statistical disclosure or intersection attacks on anonymity systems
IH'04 Proceedings of the 6th international conference on Information Hiding
The hitting set attack on anonymity protocols
IH'04 Proceedings of the 6th international conference on Information Hiding
Practical traffic analysis: extending and resisting statistical disclosure
PET'04 Proceedings of the 4th international conference on Privacy Enhancing Technologies
How to share your favourite search results while preserving privacy and quality
PETS'10 Proceedings of the 10th international conference on Privacy enhancing technologies
A practical complexity-theoretic analysis of mix systems
ESORICS'11 Proceedings of the 16th European conference on Research in computer security
Understanding statistical disclosure: a least squares approach
PETS'12 Proceedings of the 12th international conference on Privacy Enhancing Technologies
You cannot hide for long: de-anonymization of real-world dynamic behaviour
Proceedings of the 12th ACM workshop on Workshop on privacy in the electronic society
| Hi-index | 0.00 |
We present the Vida family of abstractions of anonymous communication systems, model them probabilistically and apply Bayesian inference to extract patterns of communications and user profiles. The first is a very generic Vida Black-box model that can be used to analyse information about all users in a system simultaneously, while the second is a simpler Vida Red-Blue model, that is very efficient when used to gain information about particular target senders and receivers. We evaluate the Red-Blue model to find that it is competitive with other established long-term traffic analysis attacks, while additionally providing reliable error estimates, and being more flexible and expressive.