Average Transitive Trustworthy Degrees for Trustworthy Networks

Authors:
Yixiang Chen;Min Zhang;Hong Zhu;Tianming Bu
Affiliations:
Shanghai Key Laboratory of Trustworthy Computing, East China Normal University, Shanghai, China 200062;Shanghai Key Laboratory of Trustworthy Computing, East China Normal University, Shanghai, China 200062;Shanghai Key Laboratory of Trustworthy Computing, East China Normal University, Shanghai, China 200062;Shanghai Key Laboratory of Trustworthy Computing, East China Normal University, Shanghai, China 200062
Venue:
RSKT '09 Proceedings of the 4th International Conference on Rough Sets and Knowledge Technology
Year:
2009

Citing 9
Cited 0

The right type of trust for distributed systems

NSPW '96 Proceedings of the 1996 workshop on New security paradigms
Prospectives for Modelling Trust in Information Security

ACISP '97 Proceedings of the Second Australasian Conference on Information Security and Privacy
Valuation of Trust in Open Networks

ESORICS '94 Proceedings of the Third European Symposium on Research in Computer Security
Trust Relationships in Secure Systems-A Distributed Authentication Perspective

SP '93 Proceedings of the 1993 IEEE Symposium on Security and Privacy
Trust network analysis with subjective logic

ACSC '06 Proceedings of the 29th Australasian Computer Science Conference - Volume 48
Investigating interactions of trust and interest similarity

Decision Support Systems
A survey of trust and reputation systems for online service provision

Decision Support Systems
Trust in health infomediaries

Decision Support Systems
Faster maximum and minimum mean cycle algorithms for system-performance analysis

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

The goal of this paper is to investigate measurement models of transitive trustworthiness for trustworthy networks. The reals in the interval [0,1] are used to define trust degrees in such a way that the larger its trust degree and the more it is trustworthy. A basic contribution is to introduce the average algorithm for the measurement of the transitive trustworthiness along a path in a weighted digraph. Due to the NP-hardness of the average algorithm for finding simple paths with the maximal average transitive trust degree, we propose the modified matrix operation to compute maximal average transitive trustworthy degrees of paths. This computation is polynomial, but might produce non-simple paths. A simple simulation is also given.