Skip to main content

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 381))

Abstract

In modern global networks, principals usually have incomplete information about each other. Therefore trust and reputation frameworks have been recently adopted to maximise the security level by basing decision making on estimated trust values for network peers. Existing models for trust and reputation have ignored dynamic behaviours, or introduced ad hoc solutions. In this paper, we introduce the HMM-based reputation model for network principals, where the dynamic behaviour of each one is represented by a hidden Markov model (HMM). We describe the elements of this novel reputation model. In particular we detail the representation of reputation reports. We also describe a mixing scheme that efficiently approximates the behaviour of a trustee given multiple reports about it from different sources.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Baum, L.E., Petrie, T.: Statistical inference for probabilistic functions of finite-state Markov chains. Annals of Mathematical Statistics 37(6), 1554–1563 (1966)

    Article  MathSciNet  MATH  Google Scholar 

  2. Baum, L.E., Petrie, T., Soules, G., Weiss, N.: A maximization technique occurring in the statistical analysis of probabilistic functions of markov chains. The Annals of Mathematical Statistics 41(1), 164–171 (1970)

    Article  MathSciNet  MATH  Google Scholar 

  3. Brémaud, P.: Markov chains: Gibbs fields, Monte Carlo simulation, and queues. Springer (1998)

    Google Scholar 

  4. Buchegger, S., Le Boudec, J.: A Robust Reputation System for Peer-to-Peer and Mobile Ad-hoc Networks. In: P2PEcon 2004 (2004)

    Google Scholar 

  5. Cahill, V., Gray, E., Seigneur, J.M., Jensen, C.D., Chen, Y., Shand, B., Dimmock, N., Twigg, A., Bacon, J., English, C., Wagealla, W., Terzis, S., Nixon, P., Serugendo, G., Bryce, C., Carbone, M., Krukow, K., Nielsen, M.: Using trust for secure collaboration in uncertain environments. IEEE Pervasive Computing 2(3), 52–61 (2003)

    Article  Google Scholar 

  6. Cover, T.M., Thomas, J.A.: Elements of Information Theory, 2nd edn. Wiley Series in Telecommunications and Signal Processing. Wiley-Interscience (July 2006)

    Google Scholar 

  7. ElSalamouny, E., Krukow, K., Sassone, V.: An analysis of the exponential decay principle in probabilistic trust models. Theoretical Computer Science 410(41), 4067–4084 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  8. ElSalamouny, E., Sassone, V.: An hmm-based reputation model. Technical report, INRIA (2013), http://hal.inria.fr/hal-00831401

  9. ElSalamouny, E., Sassone, V., Nielsen, M.: HMM-based trust model. In: Degano, P., Guttman, J. (eds.) FAST 2009. LNCS, vol. 5983, pp. 21–35. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  10. Grimmet, G., Stirzaker, D.: Probability and Random Processes, 3rd edn. Oxford University Press (2001)

    Google Scholar 

  11. Jøsang, A., Haller, J.: Dirichlet reputation systems. In: The Second International Conference on Availability, Reliability and Security, ARES 2007, pp. 112–119 (2007)

    Google Scholar 

  12. Jøsang, A., Ismail, R.: The beta reputation system. In: Proceedings from the 15th Bled Conference on Electronic Commerce, Bled (2002)

    Google Scholar 

  13. Kullback, S., Leibler, R.A.: On information and sufficiency. Annals of Mathematical Statistics 22(1), 79–86 (1951)

    Article  MathSciNet  MATH  Google Scholar 

  14. Mui, L., Mohtashemi, M., Halberstadt, A.: A computational model of trust and reputation (for ebusinesses). In: Proceedings from 5th Annual Hawaii International Conference on System Sciences, HICSS 2002, p. 188. IEEE (2002)

    Google Scholar 

  15. Nielsen, M., Krukow, K., Sassone, V.: A bayesian model for event-based trust. Electronic Notes in Theoretical Computer Science (ENTCS) 172, 499–521 (2007)

    Article  MathSciNet  Google Scholar 

  16. Norris, J.R.: Markov chains. Cambridge University Press (1997)

    Google Scholar 

  17. Rabiner, L., Juang, B.H.: Fundamentals of Speech Recognition. United states ed edn. Prentice Hall PTR (April 1993)

    Google Scholar 

  18. Rabiner, L.R.: A tutorial on hidden markov models and selected applications in speech recognition. Proceedings of the IEEE 77(2), 257–286 (1989)

    Article  Google Scholar 

  19. Teacy, W., Patel, J., Jennings, N., Luck, M.: Travos: Trust and reputation in the context of inaccurate information sources. Autonomous Agents and Multi-Agent Systems 12, 183–198 (2006)

    Article  Google Scholar 

  20. Xiong, L., Liu, L.: PeerTrust: Supporting reputation-based trust for peer-to-peer electronic communities. IEEE Transactions on Knowledge and Data Engineering 16(7), 843–857 (2004)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

ElSalamouny, E., Sassone, V. (2013). An HMM-Based Reputation Model. In: Awad, A.I., Hassanien, A.E., Baba, K. (eds) Advances in Security of Information and Communication Networks. SecNet 2013. Communications in Computer and Information Science, vol 381. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-40597-6_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-40597-6_9

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-40596-9

  • Online ISBN: 978-3-642-40597-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics