The small-world phenomenon: an algorithmic perspective
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Communications of the ACM
Performance analysis of the CONFIDANT protocol
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
The Eigentrust algorithm for reputation management in P2P networks
WWW '03 Proceedings of the 12th international conference on World Wide Web
A Computational Model of Trust and Reputation for E-businesses
HICSS '02 Proceedings of the 35th Annual Hawaii International Conference on System Sciences (HICSS'02)-Volume 7 - Volume 7
PeerTrust: Supporting Reputation-Based Trust for Peer-to-Peer Electronic Communities
IEEE Transactions on Knowledge and Data Engineering
Task delegation using experience-based multi-dimensional trust
Proceedings of the fourth international joint conference on Autonomous agents and multiagent systems
Trust network analysis with subjective logic
ACSC '06 Proceedings of the 29th Australasian Computer Science Conference - Volume 48
Inferring binary trust relationships in Web-based social networks
ACM Transactions on Internet Technology (TOIT)
Optimal Trust Network Analysis with Subjective Logic
SECURWARE '08 Proceedings of the 2008 Second International Conference on Emerging Security Information, Systems and Technologies
Heuristic Discovery of Role-Based Trust Chains in Peer-to-Peer Networks
IEEE Transactions on Parallel and Distributed Systems
Robust combination rules for evidence theory
Information Fusion
A personalized framework for trust assessment
Proceedings of the 2009 ACM symposium on Applied Computing
Trust Computing for Social Networking
ITNG '09 Proceedings of the 2009 Sixth International Conference on Information Technology: New Generations
Group-Based Trust Management Scheme for Clustered Wireless Sensor Networks
IEEE Transactions on Parallel and Distributed Systems
Poisonedwater: An improved approach for accurate reputation ranking in P2P networks
Future Generation Computer Systems
Information theoretic framework of trust modeling and evaluation for ad hoc networks
IEEE Journal on Selected Areas in Communications
On trust models and trust evaluation metrics for ad hoc networks
IEEE Journal on Selected Areas in Communications
Editorial: Special Section: Trusted computing
Future Generation Computer Systems
FlowTrust: trust inference with network flows
Frontiers of Computer Science in China
Journal of Network and Computer Applications
Subgraph Extraction for Trust Inference in Social Networks
ASONAM '12 Proceedings of the 2012 International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2012)
MATRI: a multi-aspect and transitive trust inference model
Proceedings of the 22nd international conference on World Wide Web
Generating trusted graphs for trust evaluation in online social networks
Future Generation Computer Systems
Engineering Security Agreements Against External Insider Threat
Information Resources Management Journal
| Hi-index | 0.00 |
Trust management is an extensively investigated topic. A lot of trust models and systems have been proposed in the literature. However, a universally agreed trust model is rarely seen due to the fact that trust is essentially subjective and different people may have different views on it. We focus on the personalization of trust in order to catch this subjective nature of trust. We propose a multi-dimensional evidence-based trust management system with multi-trusted paths (MeTrust for short) to conduct trust computation on any arbitrarily complex trusted graph. The trust computation in MeTrust is conducted at three tiers, namely, the node tier, the path tier, and the graph tier. At the node tier, we consider multi-dimensional trust. Users can define a primary dimension and alternative dimensions on their own and users can make their own privileged strategies and setup weights for different dimensions for trust computation. At the path tier, we propose to use the Frank t-norm for users to control the decay rate for trust combination, which can be tuned in between the minimum trust combination (there is no decay in terms of the path length) and the product trust combination (the decay is too fast when the path length is relatively large). At the graph tier, we propose GraphReduce, GraphAdjust, and WeightedAverage algorithms to simplify any arbitrarily complex trusted graph. We employ trust truncation and trust equivalence to guarantee that every link in the graph will be used exactly once for trust computation. We evaluated trust truncation ratio and trust success ratio through extensive experiments, which can serve as a guide for users to select from a wide spectrum of trust parameters for trust computation.