Hier finden Sie wissenschaftliche Publikationen aus den Fraunhofer-Instituten.

Measuring unlinkability revisited

: Fischer, L.; Katzenbeisser, S.; Eckert, C.


Association for Computing Machinery -ACM-, Special Interest Group on Security, Audit and Control -SIGSAC-:
CCS'08 Workshops, Proceedings of the 15th ACM Conference on Computer & Communications Security co-located Workshops. CD-ROM : Alexandria & Fairfax, Virginia, USA. October 27-31, 2008
New York: ACM, 2008
ISBN: 978-1-60558-287-0
Workshop on Privacy in the Electronic Society (WPES) <7, 2008, Alexandria/Va.>
Conference on Computer and Communications Security (CCS) <15, 2008, Alexandria/Va.>
Conference Paper
Fraunhofer SIT ()

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.