Name
Abstract | ||
|---|---|---|
In this paper we define a new metric for quantifying the degree of anonymity collectively afforded to users of an anonymous communication system. We show how our metric, based on the permanent of a matrix, can be useful in evaluating the amount of information needed by an observer to reveal the communication pattern as a whole. We also show how our model can be extended to include probabilistic information learned by an attacker about possible sender-recipient relationships. Our work is intended to serve as a complementary tool to existing information-theoretic metrics, which typically consider the anonymity of the system from the perspective of a single user or message. |
Year | DOI | Venue |
|---|---|---|
2007 | 10.1109/ISI.2007.379497 | ISI |
Keywords | Field | DocType |
computer science,bipartite graph,message authentication,graph theory,adjacency matrix,tin,privacy,probability,computational complexity | Graph theory,Adjacency matrix,Message authentication code,Computer science,Bipartite graph,Communications system,Theoretical computer science,Probabilistic logic,Anonymity,Observer (quantum physics) | Conference |
Citations | PageRank | References |
43 | 1.42 | 13 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Matthew Edman | 1 | 163 | 5.95 |
| Fikret Sivrikaya | 2 | 123 | 13.30 |
| Bülent Yener | 3 | 1075 | 94.51 |