Measuring unlinkability revisited
Open Access
- 27 October 2008
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 105-110
Abstract
Unlinkability describes the inability of an observer to decide whether certain items of interest are related or not. Privacy aware protocol designers need a consistent and meaningful unlinkability measure to asses protocols in face of different attacks. In this paper we show that entropy measures are not sufficient for measuring unlinkability. We propose an alternative measure that estimates the error made by an attacker. We show by example that our expected distance provides a consistent measure that offers a better estimation of message-unlinkability.Keywords
This publication has 5 references indexed in Scilit:
- k-Unlinkability: A privacy protection model for distributed dataData & Knowledge Engineering, 2008
- AMOEBA: Robust Location Privacy Scheme for VANETIEEE Journal on Selected Areas in Communications, 2007
- Modelling Unlinkability2003
- The resemblance coefficients in group technology: A survey and comparative study of relational metricsComputers & Industrial Engineering, 1996
- Binary coefficients: A theoretical and empirical studyMathematical Geology, 1976