General Methodology for Analysis and Modeling of Trust Relationships in Distributed Computing

Abstract

Abstract-In this paper, we discuss a general methodology for analysis and modeling of trust relationships in distributed computing. We discuss the classification of trust relationships, categorize trust relationships into two layers and provide a hierarchy of trust relationships based on a formal definition of trust relationship. We provide guidelines for the analysis and modeling of trust relationships. We review operations on trust relationships and relative types of trust relationships in our previous work. We provide a set of definitions for the properties of direction and symmetry of trust relationships. In order to analyze and model the scope and diversity of trust relationship, we define trust scope label. We provide some example scenarios to illustrate the proposed definitions about properties of trust relationship. All the definitions about the properties of trust relationships are elements of the taxonomy framework of trust relationships. We discuss the lifecycle of trust relationships that includes the analysis and modeling of trust relationships, trust relationships at runtime, and change management of trust relationships. We propose a trust management architecture at high level to place the analysis and modeling of trust relationships under the background of trust management.Index Terms-trust relationship, properties of trust relationship, life cycle of trust relationship, trust management, distributed information system

A modal type theory for formalizing trusted communications

“…A different approach to trust for distributed systems is presented in [76], based on set-theoretic operations defined over a quadruple composed by the set of trustors, the one of trustees, one of conditions and one of properties. The intended meaning is that under a given set of circumstances (conditions), the set of trustors trust the set of trustees about a given set of properties, the latter partitioned in a set of actions and a set of attributes.…”

“…on the message from the point of view of the receiver, we cannot grant that every message sent is successfully received. 20 The restriction enforced by considering an occurrence of trust between two agents with respect to a content, perfectly endorses the definition of trust relationship at runtime for information systems given in [76], where also the generalization to sets of agents is presented. 21 We model this property having in mind its semantic counterpart: the difference between Transmission and Transitivity is that whereas the former is of the form K a K b p → K a p, the latter takes the form K a p → K b K a p, with a, b in the set of Agents and p a propositional content of information.…”

A Protocol for Pervasive Distributed Computing Reliability

“…A general methodology for trust management in distributed computing can be found in [3]. The authors categorize the trust relationships into two layers.…”

“…In the first case, a node behavior is evaluated by considering its reputation with the other nodes in the system; in the second case, the trust mechanism restricts the access to resources and services based on credentials of nodes. According to the classification proposed in [3], our trusting protocol can be classified as reputation based and it refers to the delegation trust in a decentralized manner.…”