An evidential model of distributed reputation management
Proceedings of the first international joint conference on Autonomous agents and multiagent systems: part 1
Valuation of Trust in Open Networks
ESORICS '94 Proceedings of the Third European Symposium on Research in Computer Security
A Subjective Metric of Authentication
ESORICS '98 Proceedings of the 5th European Symposium on Research in Computer Security
The Eigentrust algorithm for reputation management in P2P networks
WWW '03 Proceedings of the 12th international conference on World Wide Web
Decentralized Trust Management
SP '96 Proceedings of the 1996 IEEE Symposium on Security and Privacy
PeerTrust: Supporting Reputation-Based Trust for Peer-to-Peer Electronic Communities
IEEE Transactions on Knowledge and Data Engineering
| Hi-index | 0.00 |
The trusted computing has become an effective method to resolve trust related problems in current network security environment. In order to improve the trustworthiness of trust evaluation, a model based on weighted closeness of trust combination (WCTC) is presented. The model chooses the trusted path with considering the transition fading, time decay, weight of the path and so on. The model decreases the time complexity in the search of the trusted paths. The model uses weighted closeness to combine the recommendation paths. Through building the trusted network, the validity of the model is analyzed by mathematics method, and the policy to inhibit the malicious recommendation is given. Finally, the experiment has shown that this model has improved the trustworthiness of trust evaluation, the trust combination based on weighted closeness of the trust combination can be used in various trust models and it has better adaptability.