TU Darmstadt / ULB / TUprints

Measuring Unlinkability for Privacy Enhancing Technologies

Fischer, Lars (2010)
Measuring Unlinkability for Privacy Enhancing Technologies.
Technische Universität Darmstadt
Ph.D. Thesis, Primary publication

[img]
Preview
Measuring Unlinkability for Privacy Enhancing Technologies - PDF
lars_fischer_dissertation.pdf
Copyright Information: CC BY-NC-ND 2.5 Generic - Creative Commons, Attribution, NonCommercial, NoDerivs .

Download (4MB) | Preview
Item Type: Ph.D. Thesis
Type of entry: Primary publication
Title: Measuring Unlinkability for Privacy Enhancing Technologies
Language: English
Referees: Eckert, Prof. Dr. Claudia ; Katzenbeisser, Prof. Dr. Stefan ; Kesdogan, Prof. Dr. Dogan
Date: 13 December 2010
Place of Publication: Darmstadt
Date of oral examination: 29 November 2010
Corresponding Links:
Abstract:

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.

Alternative Abstract:
Alternative AbstractLanguage

Der Fokus dieser Arbeit ist die quantitative Analyse von Unverkettbarkeit. Unter Unverkettbarkeit versteht man die Unmöglichkeit, dass ein Angreifer in der Lage ist Datenobjekte bezüglich einer bestimmten Eigenschaft in Beziehung zu setzen. Ausgehend von grundlegenden Kriterien wird, auf Basis formaler Definition des Verkettbarkeitsproblems, ein neues Maß entwickelt. Es wird gezeigt, dass dieses Maß der "inneren Struktur" von Verkettbarkeitsproblemen Rechnung trägt. Bisher bekannten Maßen fehlt diese Eigenschaft. Darüber hinaus werden in dieser Arbeit Modelle für Verkettbarkeitsprobleme in Zertifizierungs-strukturen vorgestellt und ein Protokoll zur anonymen, revozierbaren Zertifizierung analysiert.

German
Uncontrolled Keywords: unlinkability, measure, privacy enhancing technology, vehicular communication, privacy, unlinkability problem, anonymity problem
Alternative keywords:
Alternative keywordsLanguage
unlinkability, measure, privacy enhancing technology, vehicular communication, privacy, unlinkability problem, anonymity problemEnglish
URN: urn:nbn:de:tuda-tuprints-23674
Classification DDC: 000 Generalities, computers, information > 004 Computer science
500 Science and mathematics > 510 Mathematics
Divisions: 20 Department of Computer Science
Date Deposited: 04 Jan 2011 07:24
Last Modified: 07 Dec 2012 11:58
URI: https://tuprints.ulb.tu-darmstadt.de/id/eprint/2367
PPN: 22995362X
Export:
Actions (login required)
View Item View Item