Optimal Trust Network Analysis with Subjective Logic

Authors:
Audun Jøsang;Touhid Bhuiyan
Affiliations:
-;-
Venue:
SECURWARE '08 Proceedings of the 2008 Second International Conference on Emerging Security Information, Systems and Technologies
Year:
2008

Citing 0
Cited 8

Integrating Trust with Public Reputation in Location-Based Social Networks for Recommendation Making

WI-IAT '08 Proceedings of the 2008 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology - Volume 03
Towards Trustworthy Delegation in Role-Based Access Control Model

ISC '09 Proceedings of the 12th International Conference on Information Security
Multi-dimensional evidence-based trust management with multi-trusted paths

Future Generation Computer Systems
Developing trust networks based on user tagging information for recommendation making

WISE'10 Proceedings of the 11th international conference on Web information systems engineering
Aggregating trust using triangular norms in the keynote trust management system

STM'10 Proceedings of the 6th international conference on Security and trust management
FloodTrust for Improved Trust Transitivity

WI-IAT '11 Proceedings of the 2011 IEEE/WIC/ACM International Conferences on Web Intelligence and Intelligent Agent Technology - Volume 02
Reflections on Trust in Devices: An Informal Survey of Human Trust in an Internet-of-Things Context

Wireless Personal Communications: An International Journal
The state-of-the-art in personalized recommender systems for social networking

Artificial Intelligence Review

Quantified Score

Hi-index	0.00

Visualization

Abstract

Trust network analysis with subjective logic (TNA-SL) simplifies complex trust graphs into series-parallel graphs by removing the most uncertain paths to obtain a canonical graph. This simplification could in theory cause loss of information and thereby lead to sub-optimal results. This paper describes a new method for trust network analysis which is considered optimal because it does not require trust graph simplification, but instead uses edge splitting to obtain a canonical graph. The new method is compared with TNA-SL, and our simulation shows that both methods produce equal results. This indicates that TNA-SL in fact also represents an optimal method for trust network analysis and that the trust graph simplification does not affect the result.