ACM Transactions on Computer Systems (TOCS)
Search and replication in unstructured peer-to-peer networks
ICS '02 Proceedings of the 16th international conference on Supercomputing
IEEE Internet Computing
IEEE Internet Computing
Chord: a scalable peer-to-peer lookup protocol for internet applications
IEEE/ACM Transactions on Networking (TON)
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems
Middleware '01 Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms Heidelberg
Small worlds in security systems: an analysis of the PGP certificate graph
Proceedings of the 2002 workshop on New security paradigms
Improving Search in Peer-to-Peer Networks
ICDCS '02 Proceedings of the 22 nd International Conference on Distributed Computing Systems (ICDCS'02)
Making gnutella-like P2P systems scalable
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Model-Driven Trust Negotiation for Web Services
IEEE Internet Computing
Semantic constraints for trust transitivity
APCCM '05 Proceedings of the 2nd Asia-Pacific conference on Conceptual modelling - Volume 43
Exploiting Dynamic Querying like Flooding Techniques in Unstructured Peer-to-Peer Networks
ICNP '05 Proceedings of the 13TH IEEE International Conference on Network Protocols
iTrust'05 Proceedings of the Third international conference on Trust Management
Evaluation of P2P Algorithms for Probabilistic Trust Inference in a Web of Trust
EPEW '08 Proceedings of the 5th European Performance Engineering Workshop on Computer Performance Engineering
Fast Generation of Scale Free Networks with Directed Arcs
EPEW '09 Proceedings of the 6th European Performance Engineering Workshop on Computer Performance Engineering
A trust-based robust and efficient searching scheme for peer-to-peer networks
ICICS'10 Proceedings of the 12th international conference on Information and communications security
A secure and efficient searching scheme for trusted nodes in a peer-to-peer network
CISIS'11 Proceedings of the 4th international conference on Computational intelligence in security for information systems
Secure and privacy-aware searching in peer-to-peer networks
DPM'11 Proceedings of the 6th international conference, and 4th international conference on Data Privacy Management and Autonomous Spontaneus Security
A social network-based trust-aware propagation model for P2P systems
Knowledge-Based Systems
| Hi-index | 0.00 |
Distributed security models based on a 'web of trust' eliminate single points of failure and alleviate performance bottlenecks. However, such distributed approaches rely on the ability to find trust paths between participants, which introduces performance overhead. It is therefore of importance to develop trust path discovery algorithms that minimize such overhead. Since peer-to-peer (P2P) networks share various characteristics with the web of trust, P2P search algorithms can potentially be exploited to find trust paths. In this paper we systematically evaluate the application of P2P search algorithms to the trust path discovery problem. We consider the number of iterations required (as expressed by the TTL parameter) as well as the messaging overhead, for discovery of single as well as multiple trust paths. Since trust path discovery does not allow for resource replication (usual in P2P applications), we observe that trust path discovery is very sensitive to parameter choices in selective forwarding algorithms (such as K-walker), but is relatively fast when the underlying network topology is scale-free.