A Heuristic to Explore Trust Networks Dynamics

  • Vincenza Carchiolo
  • Alessandro Longheu
  • Michele Malgeri
  • Giuseppe Mangioni
Part of the Studies in Computational Intelligence book series (SCI, volume 511)

Abstract

The shifting of computation and storage towards distributed, embedded and mobile systems encompasses several advantages, as the increasing in performance, scalability, and reduction of costs. A significant drawback though is the potential lack in security and trust, due to a huge number of different, dispersed devices. In such a context, trust-based networks allow to rank nodes (e.g. devices) so that only the best are chosen to store and manipulate users personal data. However, the study of rank assessment and how a node can improve its value may become a hard task, expecially for large networks. Therefore, in this work we propose a heuristic based on statistical considerations that allows a node to achieve a good rank via a proper selection of trust links with other nodes, preserving both the effectiveness and the efficiency.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Armbrust, M., Fox, A., Griffith, R., Joseph, A.D., Katz, R., Konwinski, A., Lee, G., Patterson, D., Rabkin, A., Stoica, I., Zaharia, M.: A view of cloud computing. Commun. ACM 53(4), 50–58 (2010)CrossRefGoogle Scholar
  2. 2.
    Hansmann, U., Nicklous, M.S., Stober, T.: Pervasive computing handbook. Springer-Verlag New York, Inc., New York (2001)CrossRefMATHGoogle Scholar
  3. 3.
    Nieuwdorp, E.: The pervasive discourse: an analysis. Comput. Entertain. 5(2), 13 (2007)CrossRefGoogle Scholar
  4. 4.
    Santos, N., Gummadi, K.P., Rodrigues, R.: Towards trusted cloud computing. In: Proceedings of the 2009 Conference on Hot Topics in Cloud Computing, HotCloud 2009. USENIX Association, Berkeley (2009)Google Scholar
  5. 5.
    Dietrich, K., Winter, J.: Implementation aspects of mobile and embedded trusted computing. In: Chen, L., Mitchell, C.J., Martin, A. (eds.) Trust 2009. LNCS, vol. 5471, pp. 29–44. Springer, Heidelberg (2009)CrossRefGoogle Scholar
  6. 6.
    Wang, Y., Norice, G., Cranor, L.F.: Who is concerned about what? a study of american, chinese and indian users’ privacy concerns on social network sites. In: McCune, J.M., Balacheff, B., Perrig, A., Sadeghi, A.-R., Sasse, A., Beres, Y. (eds.) Trust 2011. LNCS, vol. 6740, pp. 146–153. Springer, Heidelberg (2011)CrossRefGoogle Scholar
  7. 7.
    Kamvar, S.D., Schlosser, M.T., Garcia-Molina, H.: The eigentrust algorithm for reputation management in P2P networks. In: Proceedings of the Twelfth International World Wide Web Conference (2003)Google Scholar
  8. 8.
    Zhou, R., Hwang, K., Cai, M.: Gossiptrust for fast reputation aggregation in peer-to-peer networks. IEEE Trans. on Knowl. and Data Eng. 20(9), 1282–1295 (2008)CrossRefGoogle Scholar
  9. 9.
    Zhou, R., Hwang, K.: Powertrust: A robust and scalable reputation system for trusted peer-to-peer computing. IEEE Trans. Parallel Distrib. Syst. 18(4), 460–473 (2007)CrossRefGoogle Scholar
  10. 10.
    Walter, F.E., Battiston, S., Schweitzer, F.: Personalised and dynamic trust in social networks. In: Bergman, L.D., Tuzhilin, A., Burke, R.D., Felfernig, A., Schmidt-Thieme, L. (eds.) RecSys, pp. 197–204. ACM (2009)Google Scholar
  11. 11.
    Marsh, S.: Formalising trust as a computational concept. Technical report, University of Stirling. PhD thesis (1994)Google Scholar
  12. 12.
    Golbeck, J.A.: Computing and applying trust in web-based social networks. PhD thesis, College Park, MD, USA, Chair-Hendler, James (2005)Google Scholar
  13. 13.
    Walter, F.E., Battiston, S., Schweitzer, F.: A model of a trust-based recommendation system on a social network. Journal of Autonomous Agents and Multi-Agent Systems 16, 57 (2008)CrossRefGoogle Scholar
  14. 14.
    Berkhin, P.: A survey on pagerank computing. Internet Mathematics 2(1), 73–120 (2005)MathSciNetCrossRefMATHGoogle Scholar
  15. 15.
    Xiong, L., Liu, L.: Peertrust: Supporting reputation-based trust for peer-to-peer electronic communities. IEEE Trans. Knowl. Data Eng. 16(7), 843–857 (2004)CrossRefGoogle Scholar
  16. 16.
    Allodi, L., Chiodi, L., Cremonini, M.: Modifying trust dynamics through cooperation and defection in evolving social networks. In: McCune, J.M., Balacheff, B., Perrig, A., Sadeghi, A.-R., Sasse, A., Beres, Y. (eds.) Trust 2011. LNCS, vol. 6740, pp. 131–145. Springer, Heidelberg (2011)CrossRefGoogle Scholar
  17. 17.
    Newman, M.E.: Assortative Mixing in Networks. Physical Review Letters 89(20), 208701 (2002)CrossRefGoogle Scholar
  18. 18.
    Opsahl, T., Panzarasa, P.: Clustering in weighted networks. Social Networks 31(2), 155–163 (2009)CrossRefGoogle Scholar
  19. 19.
    Carchiolo, V., Longheu, A., Malgeri, M., Mangioni, G.: Gain the best reputation in trust networks. In: Brazier, F.M.T., Nieuwenhuis, K., Pavlin, G., Warnier, M., Badica, C. (eds.) Intelligent Distributed Computing V. SCI, vol. 382, pp. 213–218. Springer, Heidelberg (2011)CrossRefGoogle Scholar

Copyright information

© Springer International Publishing Switzerland 2014

Authors and Affiliations

  • Vincenza Carchiolo
    • 1
  • Alessandro Longheu
    • 1
  • Michele Malgeri
    • 1
  • Giuseppe Mangioni
    • 1
  1. 1.Dip. Ingegneria Elettrica, Elettronica e Informatica, Facoltà di IngegneriaUniversità degli Studi di CataniaCataniaItaly

Personalised recommendations