Untraceable electronic mail, return addresses, and digital pseudonyms
Communications of the ACM
Proceedings of the First International Workshop on Information Hiding
Mixminion: Design of a Type III Anonymous Remailer Protocol
SP '03 Proceedings of the 2003 IEEE Symposium on Security and Privacy
Anonymity vs. Information Leakage in Anonymity Systems
ICDCS '05 Proceedings of the 25th IEEE International Conference on Distributed Computing Systems
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
Measuring Anonymity: The Disclosure Attack
IEEE Security and Privacy
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
Measuring anonymity with relative entropy
FAST'06 Proceedings of the 4th international conference on Formal aspects in security and trust
Attacking unlinkability: the importance of context
PET'07 Proceedings of the 7th international conference on Privacy enhancing technologies
Reasoning about the anonymity provided by pool mixes that generate dummy traffic
IH'04 Proceedings of the 6th international conference on Information Hiding
Anonymous connections and onion routing
IEEE Journal on Selected Areas in Communications
The bayesian traffic analysis of mix networks
Proceedings of the 16th ACM conference on Computer and communications security
A distortion-based metric for location privacy
Proceedings of the 8th ACM workshop on Privacy in the electronic society
Relations among privacy notions
ACM Transactions on Information and System Security (TISSEC)
An accurate system-wide anonymity metric for probabilistic attacks
PETS'11 Proceedings of the 11th international conference on Privacy enhancing technologies
A three dimensional sender anonymity metric
International Journal of Security and Networks
The Anonymous Subgraph Problem
Computers and Operations Research
| Hi-index | 0.00 |
Recently, Edman et al. proposed the system's anonymity level [10], a combinatorial approach to measure the amount of additional information needed to reveal the communication pattern in a mix-based anonymous communication system as a whole. The metric is based on the number of possible bijective mappings between the inputs and the outputs of the mix. In this work we show that Edman et al.'s approach fails to capture the anonymity loss caused by subjects sending or receiving more than one message. We generalize the system's anonymity level in scenarios where user relations can be modeled as yes/no relations to cases where subjects send and receive an arbitrary number of messages. Further, we describe an algorithm to compute the redefined metric.