Formal Definitions for Trust in Trusted Computing

Gai, Xinmao; Li, Yong; Chen, Yasha; Shen, Chen

doi:10.1109/uic-atc.2010.77

Cited by 11 publications

(4 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…There have been some efforts to produce mathematical definitions of trust [22,10], however intuitive informal definitions, such as "the degree of subjective belief about the behaviors of (information from) a particular entity" [8], or "the expectation that a service will be provided or a commitment will be fulfilled" [15], are convenient for the purposes of this paper. Trust research can be organized [3] in four major areas: (1) policy-based trust, (2) reputation based trust, (3) general models of trust and (4) trust information resources, related with the following applications: networking, semantic web, computational models, game theory and agents, software engineering and information resources.…”

Section: Introductionmentioning

confidence: 99%

Reputation features for trust prediction in social networks

2015

View full text Add to dashboard Cite

Section: Introductionmentioning

confidence: 99%

Reputation features for trust prediction in social networks

2015

View full text Add to dashboard Cite

“…Cho et al [5] state that Trust is subjective, changes in time (dynamic) and is context-dependent. Some authors point that Trust is reflexive, an agent trust in itself always, non antisymmetric, meaning that mutual trust does not imply identity, and that Trust decays with time and (physical or virtual) distance [7], [2].…”

Section: A Trustmentioning

confidence: 99%

On the Effect of High Order Reputation Information on Trust Prediction in Wikipedia's Vote Network

Núñez-González

Graña

2014

2014 European Network Intelligence Conference

View full text Add to dashboard Cite

When a user (the truster) in a social network is trying to solve the problem of guessing whether he/she will trust or not another user (the trustee) when he/she has not direct experience of the trustee behavior, then the truster is facing a Trust prediction problem. In this paper we deal with this problem as a classification problem based on reputation features of the target trustee. Reputation refers to the opinion that a third person (a witness) may have about the target trustee. Second and higher order reputation information comes from withnesses which have no direct contact with the trustee. The differences in the spread of relationships among users produce variable size reputation feature vectors, according to the relationships of each user. We propose probabilistic descriptors of the reputation information in order to reduce the feature vectors to the same size. In this paper we explore the prediction of Trust training some classifiers with reputation features extracted from first and second order relationships. We conclude that second order reputation features do not improve classification significatively.Both authors are with the

show abstract

“…Ukil et al in [22] summarize both points of view as: trust collects, encodes, analyzes, and presents evidence that is related to competence, honesty, security or dependability with the purpose that all activity in a network can be carried as securely as possible. Samian et al [23] and Gai et al [24] argue that before trust the most common mechanism to secure routing protocols was to use cryptographic approaches. However because of the ever-increasing number and sophistication of attacks, cryptographic approaches can no longer be considered to be the sole solution to protect wireless networks.…”

Section: Benefits Of Using Trust-based Approaches For Routing In Amentioning

confidence: 99%

“…Authors also consider that cryptographic approaches tend to be static (i.e, cryptographic keys are used for long periods of time), and that given the dynamicity of the wireless networks there is the need for dynamic approaches, such as trust. Gai [24] points out that the most used technique to establish trusted paths in wireless networks is by using certificates issued by a trusted central authority. However such technique is not possible in wireless networks because of the absence of such authority.…”

Section: Benefits Of Using Trust-based Approaches For Routing In Amentioning

confidence: 99%

Trust-Based Approaches to Solve Routing Issues in Ad-Hoc Wireless Networks: A Survey

González

Anwar

Joshi

2011

2011IEEE 10th International Conference on Trust, Security and Privacy in Computing and Communications

View full text Add to dashboard Cite

Trust is important in Ad-hoc networks because collaboration and cooperation among nodes are critical towards achieving the system's goals, such as routing reliability. In this paper, we seek to provide an understanding of the process of reputation-based trust approaches and related issues as they apply to routing in ad-hoc networks. We discuss the concept and properties of trust. We survey the following issues: the way wireless ad-hoc nodes first assume trust; the evidences that are collected to calculate trust; the calculations that are performed over the evidences; the way the decision is made to determine a trusted node; and how trust is updated to maintain a trusted environment. We provide a comparison of three well-established approaches and discuss some potential attacks against reputation-based trust.

show abstract

Formal Definitions for Trust in Trusted Computing

Cited by 11 publications

References 9 publications

Reputation features for trust prediction in social networks

Reputation features for trust prediction in social networks

On the Effect of High Order Reputation Information on Trust Prediction in Wikipedia's Vote Network

Trust-Based Approaches to Solve Routing Issues in Ad-Hoc Wireless Networks: A Survey

Contact Info

Product

Resources

About