On trust models and trust evaluation metrics for ad hoc networks

Abstract

Abstract-Within the realm of network security, we interpret the concept of trust as a relation among entities that participate in various protocols. Trust relations are based on evidence created by the previous interactions of entities within a protocol. In this work, we are focusing on the evaluation of trust evidence in ad hoc networks. Because of the dynamic nature of ad hoc networks, trust evidence may be uncertain and incomplete. Also, no preestablished infrastructure can be assumed. The evaluation process is modeled as a path problem on a directed graph, where nodes represent entities, and edges represent trust relations. We give intuitive requirements and discuss design issues for any trust evaluation algorithm. Using the theory of semirings, we show how two nodes can establish an indirect trust relation without previous direct interaction. We show that our semiring framework is flexible enough to express other trust models, most notably PGP's Web of Trust. Our scheme is shown to be robust in the presence of attackers.

A multi-dimensional trust-aware cloud service selection mechanism based on evidential reasoning approach

“…In Sun s model [24,25] , which is a trust model based on entropy theory and applies a modified evidential reasoning approach, the trust values are calculated using the probability of the weighted average method. The George s model [26] is a trust model based on semi-ring algebra theory, in which the trust problem is described as a directed graph routing problem, and trust values are calculated using semi-ring algebra and finally conduct trust evaluation. Song and Hwang [27] proposed a dynamic fuzzy logic trust model based on grid, which includes the definition and description of trust, the fuzzy reasoning and evaluation of trust relationship, and the updating and evolution of trust values.…”

On Data-Centric Trust Establishment in Ephemeral Ad Hoc Networks

“…In the latter, most contributions assume that there is no infrastructure and no PKI; trust is a relation among entities; trust is based on observations, with a history of interactions needed to establish trust. To the best of our knowledge, the computation of trust values in the context of ad hoc networks has been considered in only two cases: certification [7], [25] and routing [4], [27]. Otherwise, trust evaluation assumes the prior establishment of trust relations.…”

“…Theodorakopoulos and Baras [25] assume the transitivity of trust to establish a relation between two entities without previous interactions. In this context, they model trust evaluation as a path problem on a directed graph.…”

“…Moreover, any new data trust relationships that needed to be established required only trust in the entity that produced those data. All trust establishment logics proposed to date have been based on entities (e.g., "principals" such as nodes) making statements on data [4], [7], [9], [12], [16], [17], [24], [25]. Furthermore, traditional trust relations evolved generally slowly with time:…”

Efficient Distribution of Trust Authority Functions in Tactical Networks

“…Simultaneously, numerous authors have focused on the propagation of trust and developed models for establishing trust in MANETs [3], [4], [5], [6], [7]. In this paper, we report on the efficiency gained by combining such cluster algorithms with selected additional metrics, including trust, battery capacity of participating nodes, and metrics pertaining to the underlying network, namely cost of routing, bandwidth requirements, and desirable per-hop signal strengths.…”