Measuring Unlinkability for Privacy Enhancing Technologies.
Technische Universität, Darmstadt
[Ph.D. Thesis], (2010)
Measuring Unlinkability for Privacy Enhancing Technologies -
Available under Creative Commons Attribution Non-commercial No Derivatives, 2.5.
Download (4MB) | Preview
|Item Type:||Ph.D. Thesis|
|Title:||Measuring Unlinkability for Privacy Enhancing Technologies|
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.
|Place of Publication:||Darmstadt|
|Uncontrolled Keywords:||unlinkability, measure, privacy enhancing technology, vehicular communication, privacy, unlinkability problem, anonymity problem|
|Classification DDC:||000 Allgemeines, Informatik, Informationswissenschaft > 004 Informatik
500 Naturwissenschaften und Mathematik > 510 Mathematik
|Divisions:||20 Department of Computer Science|
|Date Deposited:||04 Jan 2011 07:24|
|Last Modified:||07 Dec 2012 11:58|
|Referees:||Eckert, Prof. Dr. Claudia and Katzenbeisser, Prof. Dr. Stefan and Kesdogan, Prof. Dr. Dogan|
|Refereed:||29 November 2010|