Advertisement

Computing of Trust in Ad-Hoc Networks

  • Huafei Zhu
  • Feng Bao
  • Jianwei Liu
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4237)

Abstract

Although, the notion of trust has been considered as a primitive for establishing relationships among nodes in ad-hoc networks, syntax and metrics of trust are not well defined. This paper studies computing of trust in ad-hoc networks and makes the following three contributions. Firstly, the notion of trust is formalized in terms of predict functions and strategy functions. Namely, the notion of trust in this paper is defined as a predict function that can be further evaluated by a strategy function for a pre-described action; Secondly, structures of trust are formalized as a map between a path in the underlying network graph and the corresponding edge of its transitive closure graph; Thirdly, a generic model for computing of trust in the small world is proposed.

Keywords

Ad-hoc network Transitive graph Trust computing 

References

  1. 1.
    Agudo, I., López, J., Montenegro, J.A.: A Representation Model of Trust Relationships with Delegation Extensions. In: Herrmann, P., Issarny, V., Shiu, S.C.K. (eds.) iTrust 2005. LNCS, vol. 3477, pp. 116–130. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  2. 2.
    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)Google Scholar
  3. 3.
    Dolev, D.: The Byzantine Generals Strike Again. J. Algorithms 3(1), 14–30 (1982)MathSciNetCrossRefzbMATHGoogle Scholar
  4. 4.
    Golbeck, J.A.: Computing and applying trust in web-based social networks. University of Maryland, College Park (2005)Google Scholar
  5. 5.
    Helmy, A.: Small worlds in wireless networks. IEEE communication letters 7(10) (October 2003)Google Scholar
  6. 6.
    Jøsang, A., Gollmann, D., Au, R.: A Method for Access Authorisation Through Delegation Networks. Australasian Information Security Workshop (2006)Google Scholar
  7. 7.
    Li, T.-Y., Zhu, H., Lam, K.-Y.: A Novel Two-Level Trust Model for Grid. In: Qing, S., Gollmann, D., Zhou, J. (eds.) ICICS 2003. LNCS, vol. 2836, pp. 214–225. Springer, Heidelberg (2003)CrossRefGoogle Scholar
  8. 8.
    Micali, S., Rivest, R.L.: Transitive Signature Schemes. In: Preneel, B. (ed.) CT-RSA 2002. LNCS, vol. 2271, pp. 236–243. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  9. 9.
    Reiter, M., Stubblebine, S.: Resilient authentication using path in- dependence. IEEE Transactions on computers 47(12) (1998)Google Scholar
  10. 10.
    Subramanian, L., Katz, R.H., Roth, V., Shenker, S., Stoica, I.: Reliable broadcast in unknown fixed-identity networks. In: PODC 2005, pp. 342–351 (2005)Google Scholar
  11. 11.
    Yao, A.C.: Probabilistic Computations: Toward a Unified Measure of Complexity (Extended Abstract). In: FOCS 1977, pp. 222–227 (1977)Google Scholar
  12. 12.
    Yahalom, R., Klein, B., Beth, T.: Trust-Based Navigation in Distribution Systems. Computing Systems 7(1), 45–73 (1994)Google Scholar
  13. 13.
    Zhu, H.: New model on undirected transitive signatures. IEE Proceedings of Communication (2004)Google Scholar
  14. 14.
    Zhu, H., Feng, B., Deng, R.H.: Computing of Trust in Distributed Networks (eprint 2003), http://www.iacr.org
  15. 15.
    Zhu, H., Bao, F., Li, T.: Compact Stimulation Mechanism for Routing Discovery Protocols in Civilian Ad-Hoc Networks. Communications and Multimedia Security 2005, pp. 200–209. Springer, Heidelberg (2005)Google Scholar
  16. 16.
    Zhu, H., Bao, F., Deng, R.H.: Computing of Trust in wireless Networks. In: IEEE Vehicular Technology Conference (2004)Google Scholar

Copyright information

© IFIP International Federation for Information Processing 2006

Authors and Affiliations

  • Huafei Zhu
    • 1
  • Feng Bao
    • 1
  • Jianwei Liu
    • 1
  1. 1.Institute for Infocomm Research, A-starSingapore

Personalised recommendations