IPLess Stochastic Anonymous Routing Algorithm Using Multi-Agent Systems

The ability of communicating with a selected party anonymously is an important aspect of network security. Communicating anonymously means that no adversary can discern who is communicating with whom at which time and how much information is being sent. A great deal of work has been performed to provide such anonymity with different degrees of success. We propose an algorithm for anonymous communication that is based on the notion of the traditional onion routing algorithm. However, the proposed algorithm relies on a stochastic approach and is carried out by a swarm of cooperating mobile agents. We introduce the concepts of anonymous game, linear heterogeneous onion and non-linear heterogeneous onion to provide data manipulation. We provide mathematical models that are based on the algorithm, to estimate the degree of anonymity. Applying this algorithm, and the accompanying models, one is able to measure quantitatively the success probability of message delivery. We show that this me...

• Type: Journal
• Year: 2007
• Where: IJNSEC
• Authors: Magdy Saeb, Meer Hamza, Ahmed El-Shikh
• Keywords: Algorithm, Heterogeneous Onion, IJNSEC 2007, Non-linear Heterogeneous Onion