@inproceedings{74a989b72fac4b0484e55ed047d548b8,
title = "Measuring anonymity with relative entropy",
abstract = "Anonymity is the property of maintaining secret the identity of users performing a certain action. Anonymity protocols often use random mechanisms which can be described probabilistically. In this paper, we propose a probabilistic process calculus to describe protocols for ensuring anonymity, and we use the notion of relative entropy from information theory to measure the degree of anonymity these protocols can guarantee. Furthermore, we prove that the operators in the probabilistic process calculus are non-expansive, with respect to this measuring method. We illustrate our approach by using the example of the Dining Cryptographers Problem.",
author = "Yuxin Deng and Jun Pang and Peng Wu",
year = "2007",
doi = "10.1007/978-3-540-75227-1\_5",
language = "英语",
isbn = "9783540752264",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "65--79",
booktitle = "Formal Aspects in Security and Trust - Fourth International Workshop, FAST 2006, Revised Selected Papers",
address = "德国",
note = "4th International Workshop on Formal Aspects in Security and Trust, FAST 2006 ; Conference date: 26-08-2006 Through 27-08-2006",
}