The right type of trust for distributed systems
NSPW '96 Proceedings of the 1996 workshop on New security paradigms
A logic for uncertain probabilities
International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems
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
Proceedings of the International Workshop on Security Protocols
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
Trust Relationships in Secure Systems-A Distributed Authentication Perspective
SP '93 Proceedings of the 1993 IEEE Symposium on Security and Privacy
Propagation of trust and distrust
Proceedings of the 13th international conference on World Wide Web
Semantic constraints for trust transitivity
APCCM '05 Proceedings of the 2nd Asia-Pacific conference on Conceptual modelling - Volume 43
Establishing recommendation trust relationships for internetwares
ACM SIGSOFT Software Engineering Notes
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
Decision Support Systems
Simplification and analysis of transitive trust networks
Web Intelligence and Agent Systems
| Hi-index | 0.00 |
In this paper, we present a new measuring method of computing the transitive trustworthy degree between two different nodes. In this measuring method, the transitive trust degree of $u$ and $v$ along a path is measured in terms of the minimum weight of all edges on the path. For parallel paths between $u$ and $v$, the transitive trust degree is defined as the maximum among the transitive degrees of all these paths. We prove that the measuring method can be done in polynomial time.