Towards an analysis of WonGoo performance

Abstract

Purpose

As a peer‐to‐peer scalable anonymous communication system, WonGoo is a tradeoff between anonymity and efficiency. Usually, the longer the path, the stronger the anonymity, but at the same time the heavier the overhead. WonGoo lengthens the anonymity path and reduces the overhead, providing strong anonymity and high efficiency with layered encryption and random forwarding. The purpose of this paper is to analyze its performance in detail.

Design/methodology/approach

The paper focuses on measure the performance of WonGoo system with probability theory. First, it gives a brief description of the system and evaluate its payload. Then it presents a detailed security analysis of the system.

Findings

It is shown that WonGoo can protect against (n − 1) attack and provide variable anonymity, as well as how confident the collaborators can be that their immediate predecessor is in fact the path initiator. The paper measures the anonymity degree provided by WonGoo system based on information entropy and compare it with other anonymity systems.

Practical implications

The paper is helpful for the further development of WonGoo system. In addition, the results presented in this paper will be useful for users to design other anonymity system.

Originality/value

WonGoo is a peer‐to‐peer anonymity system that provides strong anonymity and high efficiency with layered encryption and random forwarding. The paper presents a detailed analysis of its performance with probability theory and measures its anonymity degree with information theory.

Citation

Lu, T., Fang, B., Sun, Y. and Cheng, X. (2007), "Towards an analysis of WonGoo performance", International Journal of Pervasive Computing and Communications, Vol. 3 No. 2, pp. 159-174. https://doi.org/10.1108/17427370710847291