Rendezvous based trust propagation to enhance distributed network security

Development of network of nodes connected with their trust values and the propagation of these trust values to far away nodes are basic operations of the modern day trustworthy networks. Trust can be exploited to mitigate the security threats in wireless network. Most of the existing trust propagation methods are based on flooding trust information, which puts a heavy burden on wireless communication, especially in ad hoc network and sensor network. In this paper, we propose a rendezvous based trust propagation scheme. Trust requester and trust provider send out trust-request and computed-trust tickets respectively, which will meet in some common rendezvous node with certain probability. Computed-trust will then be propagated to the requester. We carry out detailed performance evaluations of our scheme. The results show that our method achieves up to 66% overhead reduction in trust propagation compared to flood based methods.

[1]  Himabindu Pucha,et al.  Performance comparison of scalable location services for geographic ad hoc routing , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[2]  Zhu Han,et al.  Trust modeling and evaluation in ad hoc networks , 2005, GLOBECOM '05. IEEE Global Telecommunications Conference, 2005..

[3]  Jennifer Golbeck,et al.  SUNNY: A New Algorithm for Trust Inference in Social Networks Using Probabilistic Confidence Models , 2007, AAAI.

[4]  John S. Baras,et al.  Trust evaluation in ad-hoc networks , 2004, WiSe '04.

[5]  Jennifer Golbeck,et al.  Computing and Applying Trust in Web-based Social Networks , 2005 .

[6]  Jussi Kangasharju,et al.  Explaining BubbleStorm: Resilient, Probabilistic, and Exhaustive PeertoPeer Search , 2007, SIGCOMM 2007.

[7]  Barry Smyth,et al.  Trust in recommender systems , 2005, IUI.

[8]  Jie Wu,et al.  Mobility Reduces Uncertainty in MANETs , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

[9]  Daniele Quercia,et al.  Lightweight Distributed Trust Propagation , 2007, Seventh IEEE International Conference on Data Mining (ICDM 2007).

[10]  Munindar P. Singh,et al.  Operators for propagating trust and their evaluation in social networks , 2009, AAMAS.

[11]  Adam Tauman Kalai,et al.  Trust-based recommendation systems: an axiomatic approach , 2008, WWW.

[12]  Mehmet A. Orgun,et al.  Quality of trust for social trust path selection in complex social networks , 2010, AAMAS.

[13]  Michael C. Wendl,et al.  Collision probability between sets of random variables , 2003 .

[14]  Georg Lausen,et al.  Spreading activation models for trust propagation , 2004, IEEE International Conference on e-Technology, e-Commerce and e-Service, 2004. EEE '04. 2004.

[15]  Mani B. Srivastava,et al.  Reputation-based framework for high integrity sensor networks , 2008, TOSN.

[16]  Stefano Battiston,et al.  A model of a trust-based recommendation system on a social network , 2006, Autonomous Agents and Multi-Agent Systems.

[17]  Mani B. Srivastava,et al.  Reputation-based framework for high integrity sensor networks , 2004, SASN '04.

[18]  Feng Bao,et al.  Computing of trust in wireless networks , 2004, IEEE 60th Vehicular Technology Conference, 2004. VTC2004-Fall. 2004.

[19]  Stephen Flowerday,et al.  Trust: An Element of Information Security , 2006, SEC.

[20]  Georg Lausen,et al.  Propagation Models for Trust and Distrust in Social Networks , 2005, Inf. Syst. Frontiers.

[21]  Christof Leng,et al.  Bubblestorm : analysis of probabilistic exhaustive search in a heterogeneous peer-to-peer system (Technical report CS 2007-2) , 2007 .

[22]  Srdjan Capkun,et al.  Mobility helps security in ad hoc networks , 2003, MobiHoc '03.

[23]  X. Sun,et al.  Evaluating the impact of flooding schemes on best-effort traffic , 2005, GLOBECOM '05. IEEE Global Telecommunications Conference, 2005..

[24]  Ramanathan V. Guha,et al.  Propagation of trust and distrust , 2004, WWW '04.