DocumentCode :
2919256
Title :
A Combinatorial Approach to Measuring Anonymity
Author :
Edman, Matthew ; Sivrikaya, Fikret ; Yener, Bülent
Author_Institution :
Rensselaer Polytech. Inst., Troy
fYear :
2007
fDate :
23-24 May 2007
Firstpage :
356
Lastpage :
363
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.
Keywords :
graph theory; matrix algebra; message authentication; probability; adjacency matrix; anonymous communication system; bipartite graph; combinatorial approach; information-theoretic metric; probability; Computational complexity; Computer science; Particle measurements; Privacy; Q measurement; Size measurement; Tin;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Intelligence and Security Informatics, 2007 IEEE
Conference_Location :
New Brunswick, NJ
Electronic_ISBN :
1-4244-1329-X
Type :
conf
DOI :
10.1109/ISI.2007.379497
Filename :
4258723
Link To Document :
بازگشت