Cache enhanced anonymity systems against probabilistic attacks

No Thumbnail Available
Authors
Lu, Huabo
Bagai, Rajiv
Advisors
Issue Date
2018-05-29
Type
Conference paper
Keywords
Online anonymity , Data caching , Probabilistic attacks , Measuring anonymity , Shannon entropy , Combinatorial matrix theory
Research Projects
Organizational Units
Journal Issue
Citation
Lu H., Bagai R. (2018) Cache Enhanced Anonymity Systems Against Probabilistic Attacks. In: Gaj P., Sawicki M., Suchacka G., Kwiecień A. (eds) Computer Networks. CN 2018. Communications in Computer and Information Science, vol 860. Springer, Cham
Abstract

The technique of data caching is being increasingly recognized for its ability to increase the amount of anonymity provided by an anonymous communication network, and is expected to be widely adopted in the next generation of these systems. We present a method to measure the degree of anonymity remaining in a cache enhanced anonymity system after a probabilistic attack has been carried out on it. Our method determines the probability distribution induced by the attack on all possible communication patterns of being the true one, from which a system-wide anonymity metric is developed. The scope of our metric, in terms of the attacks it is applicable to, is far wider than that of existing methods.

Table of Contents
Description
Click on the DOI link to access the article (may not be free).
Publisher
Springer, Cham
Journal
Book Title
Series
Computer Networks. CN 2018. Communications in Computer and Information Science;v.860
PubMed ID
DOI
ISSN
1865-0929
EISSN