A Mutual Anonymous Peer-to-Peer Protocol Design

Han, Jinsong; Xiao, Li; Xiao, Renyi; Ni, Lionel M.

doi:10.1109/ipdps.2005.49

Cited by 13 publications

(2 citation statements)

References 41 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Compared with flooding search method, Random Walk [4] significantly improves search efficiency. A query message which is called a walker in Random Walk, is forwarded to one or several randomly chosen neighbors at each hop until arriving at a right resource provider within limited hops.…”

Section: Related Researchmentioning

confidence: 99%

See 1 more Smart Citation

An Alliance-Based Distributed Web Service Discovery Method

Zhang

Han

et al. 2009

2009 Fourth International Conference on Computer Sciences and Convergence Information Technology

View full text Add to dashboard Cite

In order to avoid the single-point-failure problem in centralized Web service publication and search mechanisms, an alliance-based Web Service discovery method for unstructured P2P network was proposed in this paper. A service alliance is composed of web services with same functional properties. By using of the alliance-information-list, service requests could be spread rapidly through out the alliance. This improved the efficiency of searching services. The experimental results on the PeerSim platform showed that our approach could find targets much faster and roam over a greater scope.

show abstract

Section: Related Researchmentioning

confidence: 99%

“…I-Walk (Intelligent Walks) [5] is a modification of Random Walk. Peer probe its neighbors before forwarding the query.…”

Section: Related Researchmentioning

confidence: 99%

An Alliance-Based Distributed Web Service Discovery Method

Zhang

Han

et al. 2009

2009 Fourth International Conference on Computer Sciences and Convergence Information Technology

View full text Add to dashboard Cite

show abstract

Anonymously accessing JXTA community services through split message forwarding

Arnedo-Moreno

Perez-Gilabert

Domingo-Prieto

2013

Mathematical and Computer Modelling

View full text Add to dashboard Cite

Split Message-Based Anonymity for JXTA Applications

Arnedo-Moreno

Perez-Gilabert

2012

2012 Sixth International Conference on Complex, Intelligent, and Software Intensive Systems

View full text Add to dashboard Cite

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.

show abstract

A Mutual Anonymous Peer-to-Peer Protocol Design

Abstract: ABSTRACT

Cited by 13 publications

References 41 publications

An Alliance-Based Distributed Web Service Discovery Method

An Alliance-Based Distributed Web Service Discovery Method

Anonymously accessing JXTA community services through split message forwarding

Split Message-Based Anonymity for JXTA Applications

Contact Info

Product

Resources

About