Cited By
View all- Jakobsen S(2017)Information Theoretical CryptogenographyJournal of Cryptology10.1007/s00145-016-9242-830:4(1067-1115)Online publication date: 1-Oct-2017
An accurate system-wide anonymity metric for probabilistic attacks
Authors: 
Rajiv Bagai, Huabo Lu, Rong Li, Bin TangAuthors Info & Claims
Rajiv Bagai, Huabo Lu, Rong Li, Bin TangAuthors Info & ClaimsPages 117 - 133
Abstract
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.
References
[1]
Serjantov, A., Danezis, G.: Towards an information theoretic metric for anonymity. In: Proceedings of the 2nd Privacy Enhancing Technologies Workshop, San Francisco, USA, pp. 41-53 (2002).
[2]
Diaz, C., Seys, S., Claessens, J., Preneel, B.: Towards measuring Anonymity. In: Proceedings of the 2nd Privacy Enhancing Technologies Workshop, San Francisco, USA, pp. 54-68 (2002).
[3]
Edman, M., Sivrikaya, F., Yener, B.: A combinatorial approach to measuring anonymity. In: IEEE International Conference on Intelligence and Security Informatics, New Brunswick, USA, pp. 356-363 (2007).
[4]
Asratian, A., Denley, T., H�ggkvist, R.: Bipartite graphs and their applications. Cambridge University Press, Cambridge (1998).
[5]
Egorychev, G.: The solution of van der Waerden's problem for permanents. Advances in Mathematics 42(3), 299-305 (1981).
[6]
Bapat, R., Raghavan, T.: Nonnegative matrices and applications. Cambridge University Press, Cambridge (1997).
[7]
Brualdi, R., Parter, S., Schneider, H.: The diagonal equivalence of a nonnegative matrix to a stochastic matrix. J. Mathematical Analysis and Applications 16(1), 31-50 (1966).
[8]
Sinkhorn, R.: A relationship between arbitrary positive matrices and doubly stochastic matrices. Annals of Mathematical Statistics 35, 876-879 (1964).
[9]
Sinkhorn, R., Knopp, P.: Concerning nonnegative matrices and doubly stochastic matrices. Pacific Journal of Mathematics 21(2), 343-348 (1967).
[10]
Kalantari, B., Khachiyan, L.: On the complexity of nonnegative matrix scaling. Linear Algebra and its Applications 240, 87-103 (1996).
[11]
Linial, N., Samorodnitsky, A., Wigderson, A.: A deterministic strongly polynomial algorithm for matrix scaling and approximate permanents. Combinatorica 20(4), 545-568 (2000).
[12]
Kapur, J.: Maximum entropy models in science and engineering, 2nd edn. New Age International Publishers (2009).
[13]
Gierlichs, B., Troncoso, C., Diaz, C., Preneel, B., Verbauwhede, I.: Revisiting a combinatorial approach toward measuring anonymity. In: Proceedings of the ACM Workshop on Privacy in the Electronic Society, Alexandria, USA, pp. 111-116 (2008).
[14]
Bagai, R., Tang, B.: Data caching for enhancing anonymity. In: Proceedings of the 25th IEEE International Conference on Advanced Information Networking and Applications, Singapore, pp. 135-142 (2011).
Recommendations
A system-wide anonymity metric with message multiplicities
An important goal of an anonymity system is to hide the level of communication between two users, i.e., the number of messages one user sent to another. We construct an anonymity metric that measures the extent to which the system-wide communication ...
Measuring Anonymity of Pseudonymized Data After Probabilistic Background Attacks
There is clear demand among organizations for sharing their data for mining and other purposes without compromising the privacy of individual objects contained in the data. Pseudonymization is a simple, yet widely employed technique for sanitizing such ...
Conditional anonymity with non-probabilistic adversary
We propose a new notion of anonymity, called set-theoretic conditional anonymity.We compare the hierarchy of strong anonymity and the hierarchy of conditional anonymity.We define a metric for set-theoretic conditional anonymity.We improve an existing ...
Comments
Information & Contributors
Information
Published In
Sponsors
- Microsoft: Microsoft
Publisher
Springer-Verlag
Berlin, Heidelberg
Publication History
Published: 27 July 2011
Author Tags
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations1Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 19 Oct 2024
Other Metrics
Citations
Cited By
View all- Jakobsen S(2017)Information Theoretical CryptogenographyJournal of Cryptology10.1007/s00145-016-9242-830:4(1067-1115)Online publication date: 1-Oct-2017