- Iulian Goriac
Department of Computer Science “Al.I.Cuza” University Iasi, Romania
Plausibilistic Entropy and Anonymity
A common approach behind measuring anonymity is that the larger the anonymity set is the higher the degree of anonymity it supports. Our approach builds upon this intuition proposing a very general and yet precise measure for security properties. Introduced in a paper accepted for ARES 2013 conference, plausibilistic entropy promises to offer an expressive and cost effective solution for quantifying anonymity. This article focuses on a detailed side-by-side comparison between plausibilistic entropy and Shannon entropy and underlines a promising level of compatibility between the two of them. Towards the end we present our vision on how to define a measure for anonymity based on plausibilistic entropy and how such a definition can be employed to serve practical purposes.