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.
CITATION STYLE
Shi, J. Q., Fang, B. X., & Li, B. (2004). Towards an analysis of source-rewriting anonymous systems in a lossy environment. In Lecture Notes in Computer Science (Vol. 3320, pp. 613–618). Springer Verlag. https://doi.org/10.1007/978-3-540-30501-9_118
Mendeley helps you to discover research relevant for your work.