Split Message-Based Anonymity for JXTA Applications

Abstract

Abstract-JXTA is an open peer-to-peer (P2P) protocols specification that, in its about 10 years of history, has slowly evolved to appeal to a broad set of applications. As part of this process, some long awaited security improvements have been included in the latest versions. However, under some contexts, even more advanced security requirements should be met, such as anonymity. Several approaches exist to deploy anonymity in P2P networks, but no perfect solution exists. Even though path-based approaches are quite popular, it is considered that, in dynamic groups, using a split message-based one is better. In this work, we propose an anonymity service for JXTA using such approach. The proposal takes advantage JXTA's core services, in a manner so that it can be easily integrated to existing end applications and services.

Experimental Evaluation of Anonymous Protocols under the JXTA Middlewar

“…In fact, as far as processing time is concerned, the Rumor Riding algorithm is a bit slower overall. This is even more surprising given the fact that in the JXTA design and implementation of its algorithm some performance tweaks were considered [12] in the look up method on data structures. The original proposed algorithm relied on an even more time consuming approach.…”

“…Nevertheless, to get the best out of it, some of its limitations must be previously taken into account and some good practices have to be followed [10]. The details on how the chosen anonymous protocols were adapted to the specifics of the JXTA platform at its service layer can be found in our previous work [11], [12]. Our experiments were directed towards assessing three metrics: RTT, processing time required by the protocol algorithm at each node whenever a message is received, and reliability, measured as amount of messages lost given the total number of messages sent.…”