Fischer, Lars (2010)
Measuring Unlinkability for Privacy Enhancing Technologies.
Technische Universität Darmstadt
Dissertation, Erstveröffentlichung
Kurzbeschreibung (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.
| Typ des Eintrags: | Dissertation | ||||
|---|---|---|---|---|---|
| Erschienen: | 2010 | ||||
| Autor(en): | Fischer, Lars | ||||
| Art des Eintrags: | Erstveröffentlichung | ||||
| Titel: | Measuring Unlinkability for Privacy Enhancing Technologies | ||||
| Sprache: | Englisch | ||||
| Referenten: | Eckert, Prof. Dr. Claudia ; Katzenbeisser, Prof. Dr. Stefan ; Kesdogan, Prof. Dr. Dogan | ||||
| Publikationsjahr: | 13 Dezember 2010 | ||||
| Datum der mündlichen Prüfung: | 29 November 2010 | ||||
| URL / URN: | urn:nbn:de:tuda-tuprints-23674 | ||||
| Zugehörige Links: | |||||
| Kurzbeschreibung (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. |
||||
| Alternatives oder übersetztes Abstract: |
|
||||
| Freie Schlagworte: | unlinkability, measure, privacy enhancing technology, vehicular communication, privacy, unlinkability problem, anonymity problem | ||||
| Sachgruppe der Dewey Dezimalklassifikatin (DDC): | 000 Allgemeines, Informatik, Informationswissenschaft > 004 Informatik 500 Naturwissenschaften und Mathematik > 510 Mathematik |
||||
| Fachbereich(e)/-gebiet(e): | 20 Fachbereich Informatik | ||||
| Hinterlegungsdatum: | 04 Jan 2011 07:24 | ||||
| Letzte Änderung: | 05 Mär 2013 09:44 | ||||
| PPN: | |||||
| Referenten: | Eckert, Prof. Dr. Claudia ; Katzenbeisser, Prof. Dr. Stefan ; Kesdogan, Prof. Dr. Dogan | ||||
| Datum der mündlichen Prüfung / Verteidigung / mdl. Prüfung: | 29 November 2010 | ||||
| Zugehörige Links: | |||||
| Export: | |||||
| Suche nach Titel in: | TUfind oder in Google | ||||
 |
Frage zum Eintrag |
Optionen (nur für Redakteure)
 |
Redaktionelle Details anzeigen |
Drucken
Impressum