Measuring anonymity with relative entropy

Yuxin Deng; Jun Pang; Peng Wu

doi:10.1007/978-3-540-75227-1_5

Measuring anonymity with relative entropy

Yuxin Deng^*
, Jun Pang
, Peng Wu

^*Corresponding author for this work

University of New South Wales
Shanghai Jiao Tong University
University of Oldenburg
École Polytechnique

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

45 Scopus citations

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.

Original language	English
Title of host publication	Formal Aspects in Security and Trust - Fourth International Workshop, FAST 2006, Revised Selected Papers
Publisher	Springer Verlag
Pages	65-79
Number of pages	15
ISBN (Print)	9783540752264
DOIs	https://doi.org/10.1007/978-3-540-75227-1_5
State	Published - 2007
Externally published	Yes
Event	4th International Workshop on Formal Aspects in Security and Trust, FAST 2006 - Hamilton, ON, Canada Duration: 26 Aug 2006 → 27 Aug 2006

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	4691 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	4th International Workshop on Formal Aspects in Security and Trust, FAST 2006
Country/Territory	Canada
City	Hamilton, ON
Period	26/08/06 → 27/08/06

Access to Document

10.1007/978-3-540-75227-1_5

Cite this

Deng, Y., Pang, J., & Wu, P. (2007). Measuring anonymity with relative entropy. In Formal Aspects in Security and Trust - Fourth International Workshop, FAST 2006, Revised Selected Papers (pp. 65-79). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4691 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-540-75227-1_5

@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",

}

Deng, Y, Pang, J & Wu, P 2007, Measuring anonymity with relative entropy. in Formal Aspects in Security and Trust - Fourth International Workshop, FAST 2006, Revised Selected Papers. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 4691 LNCS, Springer Verlag, pp. 65-79, 4th International Workshop on Formal Aspects in Security and Trust, FAST 2006, Hamilton, ON, Canada, 26/08/06. https://doi.org/10.1007/978-3-540-75227-1_5

Measuring anonymity with relative entropy. / Deng, Yuxin; Pang, Jun; Wu, Peng.
Formal Aspects in Security and Trust - Fourth International Workshop, FAST 2006, Revised Selected Papers. Springer Verlag, 2007. p. 65-79 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4691 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Measuring anonymity with relative entropy

AU - Deng, Yuxin

AU - Pang, Jun

AU - Wu, Peng

PY - 2007

Y1 - 2007

N2 - 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.

AB - 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.

UR - https://www.scopus.com/pages/publications/38049141694

U2 - 10.1007/978-3-540-75227-1_5

DO - 10.1007/978-3-540-75227-1_5

M3 - 会议稿件

AN - SCOPUS:38049141694

SN - 9783540752264

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 65

EP - 79

BT - Formal Aspects in Security and Trust - Fourth International Workshop, FAST 2006, Revised Selected Papers

PB - Springer Verlag

T2 - 4th International Workshop on Formal Aspects in Security and Trust, FAST 2006

Y2 - 26 August 2006 through 27 August 2006

ER -

Deng Y, Pang J, Wu P. Measuring anonymity with relative entropy. In Formal Aspects in Security and Trust - Fourth International Workshop, FAST 2006, Revised Selected Papers. Springer Verlag. 2007. p. 65-79. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-540-75227-1_5

Measuring anonymity with relative entropy

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this