The dining cryptographers problem: unconditional sender and recipient untraceability
Journal of Cryptology
Untraceable electronic mail, return addresses, and digital pseudonyms
Communications of the ACM
Proceedings of the second ACM workshop on Digital identity management
Tor: the second-generation onion router
SSYM'04 Proceedings of the 13th conference on USENIX Security Symposium - Volume 13
Does additional information always reduce anonymity?
Proceedings of the 2007 ACM workshop on Privacy in electronic society
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
Attacking unlinkability: the importance of context
PET'07 Proceedings of the 7th international conference on Privacy enhancing technologies
A framework for quantification of linkability within a privacy-enhancing identity management system
ETRICS'06 Proceedings of the 2006 international conference on Emerging Trends in Information and Communication Security
The hitting set attack on anonymity protocols
IH'04 Proceedings of the 6th international conference on Information Hiding
Evaluating adversarial partitions
ESORICS'10 Proceedings of the 15th European conference on Research in computer security
| Hi-index | 0.00 |
There exist well established models for anonymity focusing on traffic analysis, i. e., analysing properties of single messages as, e. g., timing. However there is only little work done that use linkability information, that is information about the probability that two messages have been sent by the same sender. In this paper we model information about linkability between messages as a weighted graph. We show lower and upper bounds with regards to the usefulness of linkability information for matching messages to senders. In addition to that we present simulation results, showing to which extent a matching of messages to senders is possible by using linkability information with different grades of noise.