The right type of trust for distributed systems
NSPW '96 Proceedings of the 1996 workshop on New security paradigms
Managing trust in a peer-2-peer information system
Proceedings of the tenth international conference on Information and knowledge management
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
SEAD: Secure Efficient Distance Vector Routing for Mobile Wireless Ad Hoc Networks
WMCSA '02 Proceedings of the Fourth IEEE Workshop on Mobile Computing Systems and Applications
Small-scale peer-to-peer overlays
ACM SIGOPS Operating Systems Review
Ubiquitous collaborative iTrust service: Exploring proximity collective wisdom
Information Systems Frontiers
Enforcing collaboration in peer-to-peer routing services
iTrust'03 Proceedings of the 1st international conference on Trust management
A reputation-based approach for securing vivaldi embedding system
EUNICE'07 Proceedings of the 13th open European summer school and IFIP TC6.6 conference on Dependable and adaptable networks and services
Autonomic trust management in a component based software system
ATC'06 Proceedings of the Third international conference on Autonomic and Trusted Computing
| Hi-index | 0.00 |
This paper presents a subjective approach to routing in peer-to-peer and ad hoc networks. The main difference between our approach and traditional routing models is the use of a trust model to mediate the risk inherent in routing decisions. Rather than blindly exchanging routing table entries, nodes 'discount' recommendations from other nodes using a distributed trust computation which allows them to avoid malicious, faulty and unreliable nodes and links in routing decisions. Adding the risk model allows energy-efficient routing decisions to be made in a wireless network, and we show how our model can be optimized for different network behaviours, including wireless networks. The model is described in the context of the DSR routing algorithm, although it is equally-applicable to others, including peer-to-peer routing substrates.