Measuring Unlinkability for Privacy Enhancing Technologies
Lars Fischer · Technischen Universität Darmstadt · 2011
This work contributes to the field of unlinkability. Unlinkability describes a situation where attackers are unable to correctly cluster items of interest. The focus of this work is on modelling and measuring unlinkability. It is shown that entropy based measures, like the Degree of Unlinkability are indifferent towards different unlinkability scenarios. From basic criteria a new measure, the Expected Distance Unlinkability Measure, based on a defined inner structure of unlinkability problems, is introduced. Additionally a protocol for provision of unlinkable certificates, tailored to the requirements of vehicular communication is introduced. The vehicular scenario is used throughout this work as a motivating example.