Towards an analysis of source-rewriting anonymous systems in a lossy environment

Authors:
Jin-Qiao Shi;Bin-Xing Fang;Bin Li
Affiliations:
Research Center of Computer Network and Information Security Technology, Harbin Institute of Technology, Harbin, People’s Republic of China;Research Center of Computer Network and Information Security Technology, Harbin Institute of Technology, Harbin, People’s Republic of China;Research Center of Computer Network and Information Security Technology, Harbin Institute of Technology, Harbin, People’s Republic of China
Venue:
PDCAT'04 Proceedings of the 5th international conference on Parallel and Distributed Computing: applications and Technologies
Year:
2004

Citing 5
Cited 0

The dining cryptographers problem: unconditional sender and recipient untraceability

Journal of Cryptology
Crowds: anonymity for Web transactions

ACM Transactions on Information and System Security (TISSEC)
A protocol for anonymous communication over the Internet

Proceedings of the 7th ACM conference on Computer and communications security
Towards an analysis of onion routing security

International workshop on Designing privacy enhancing technologies: design issues in anonymity and unobservability
Tarzan: a peer-to-peer anonymizing network layer

Proceedings of the 9th ACM conference on Computer and communications security

Quantified Score

Hi-index	0.00

Visualization

Abstract

Anonymity that protects the identity of participants is a basic requirement for many network-based applications. For practical anonymous communication systems, strong anonymity, reliability and efficiency are three critical properties, but they may degrade in a lossy environment (nodes failure or links crash). This paper takes Crowds system as an example and statistically analyzes the degradation of these properties in lossy environment. Theoretical deduction and numerical analysis illustrate that Crowds is reliable enough to tolerate nodes failure, but both efficiency and anonymity will degrade. With the theoretical analysis results in this paper, a Crowds system operator can adjust the parameter pf to be tolerant of different node failure rate and node corruption rate.