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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Beth, T., Borcherding, M., Klein, B.: Valuation of trust in open networks. In: Gollmann, D. (ed.) ESORICS 1994. LNCS, vol. 875, pp. 3–18. Springer, Heidelberg (1994)
Dasdan, A., Gupta, R.K.: Faster maximum and minimum mean cycle algorithms for system performance analysis. IEEE Transactions on Computer Aided Design of Integrated Circuits and Systems 17(10), 889–899 (1998)
Du, D., Ko, K.I.: Theory of Computational Complexity. John Wiley & Sons. Inc., Chichester (2000)
Jøsang, A.: The right type of trust for distributated systems. In: Meadows, C. (ed.) Proc. of 1996 New Security Paradigms, Lake Arrowhead, Canifornia, USA, September 17-20, 1996, pp. 119–131 (1996)
Jøsang, A.: Prospectives for modelling trust in information security. In: Mu, Y., Pieprzyk, J.P., Varadharajan, V. (eds.) ACISP 1997, vol. 1270, pp. 114–125. Springer, Heidelberg (1997)
Jøsang, A., Hayward, R., Pope, S.: Trust network analysis with subjective logic. In: Proceedings of the 29th Australasian Computer Science Conference, Hobart, Australia. ACM International Conference Proceeding Series, vol. 48, 171, pp. 85–94 (2006)
Jøsang, A., Ismail, R., Boyd, C.: A survey of trust and reputation systems for online service provision. Decision Support Systems 43, 618–644 (2007)
Karp, R.M.: A characterization of the minimum cycle mean in a digraph. Discrete Mathematics 23, 309–311 (1978)
Syverson, G.J., Meadows, C.: The role of trust in information integrity protocols. Journal of Computer Security 3(1), 71–84 (1995)
Song, J., Mariam Zahedi, F.: Trust in health infomediaries. Decision Support Systems 43, 390–407 (2007)
Yahalom, R., Klein, B., Beth, T.: Trust relationships in secure systems-a distributed authentication perspective. In: Proc. 1993 IEEE Symp. on Research in Security and Privacy, pp. 150–164 (1993)
Zhu, H., Wang, D., Zhou, J.: On Min/Max Mean Path. In: The First AAAC Annual Meeting (AAAC 2008), University of Hong Kong, Pokfulam, Hong Kong, April 26-27 (2008)
Ziegler, C.-N., Golbeck, J.: Investigating interactions of trust and interest similarity. Decision Support Systems 43, 460–475 (2007)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chen, Y., Zhang, M., Zhu, H., Bu, T. (2009). Average Transitive Trustworthy Degrees for Trustworthy Networks. In: Wen, P., Li, Y., Polkowski, L., Yao, Y., Tsumoto, S., Wang, G. (eds) Rough Sets and Knowledge Technology. RSKT 2009. Lecture Notes in Computer Science(), vol 5589. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02962-2_86
Download citation
DOI: https://doi.org/10.1007/978-3-642-02962-2_86
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-02961-5
Online ISBN: 978-3-642-02962-2
eBook Packages: Computer ScienceComputer Science (R0)