Bipartite graphs and their applications
Bipartite graphs and their applications
Revisiting a combinatorial approach toward measuring anonymity
Proceedings of the 7th ACM workshop on Privacy in the electronic society
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
Data Caching for Enhancing Anonymity
AINA '11 Proceedings of the 2011 IEEE International Conference on Advanced Information Networking and Applications
| Hi-index | 0.00 |
We give a critical analysis of the system-wide anonymity metric of Edman et al. [3], which is based on the permanent value of a doubly-stochastic matrix. By providing an intuitive understanding of the permanent of such a matrix, we show that a metric that looks no further than this composite value is at best a rough indicator of anonymity. We identify situations where its inaccuracy is acute, and reveal a better anonymity indicator. Also, by constructing an information-preserving embedding of a smaller class of attacks into the wider class for which this metric was proposed, we show that this metric fails to possess desirable generalization properties. Finally, we present a new anonymity metric that does not exhibit these shortcomings. Our new metric is accurate as well as general.