Research on Trust Mechanism based on Delegation Relationship in Sharing Economy

2020 ◽  
pp. 699-712
Author(s):  
Huijian Xu, Feipeng Guo, Wei Zhou
Keyword(s):  
Evidence Theory ◽  
Sharing Economy ◽  
Security Risk ◽  
Trust Mechanism ◽  
Trust Value ◽  
Trust Degree ◽  
Relevance Evaluation ◽  
Novel Method ◽  
Evaluation Information ◽  
User Trust

Trust plays a very important role in the development of sharing economy. What’s more, delegation is taken one of evaluation factors as service trust computation. However, the sharing economy based on the delegation also brings security risk. Therefore, this paper proposes a novel trust mechanism based on delegation relationship. Firstly, the paper analyzes a variety of deception which exists in the delegation relationship, then puts forward the concept of the transaction evidence and commission evidence. Secondly, by combining these two kinds of evidence, a novel method is presented. It improves computing trust value algorithm in the commission relationship by applying the evidence theory from three aspects characteristics, relevance evaluation information of evidence and user trust degree. At last, the trust mechanism is established on account of the commission relationship. The effectiveness of this trust mechanism is testified through simulation & emulation experiments.

scholarly journals BeTrust: A Dynamic Trust Model Based on Bayesian Inference and Tsallis Entropy for Medical Sensor Networks

2014 ◽  
Vol 2014 ◽  
pp. 1-10 ◽  
Author(s):  
Yan Gao ◽  
Wenfen Liu
Keyword(s):  
Bayesian Inference ◽  
Sensor Networks ◽  
Rapid Development ◽  
Trust Model ◽  
Tsallis Entropy ◽  
Single Node ◽  
Trust Mechanism ◽  
Trust Value ◽  
Medical Sensor Networks ◽  
Definition Of

With the rapid development and application of medical sensor networks, the security has become a big challenge to be resolved. Trust mechanism as a method of “soft security” has been proposed to guarantee the network security. Trust models to compute the trustworthiness of single node and each path are constructed, respectively, in this paper. For the trust relationship between nodes, trust value in every interval is quantified based on Bayesian inference. A node estimates the parameters of prior distribution by using the collected recommendation information and obtains the posterior distribution combined with direct interactions. Further, the weights of trust values are allocated through using the ordered weighted vector twice and overall trust degree is represented. With the associated properties of Tsallis entropy, the definition of path Tsallis entropy is put forward, which can comprehensively measure the uncertainty of each path. Then a method to calculate the credibility of each path is derived. The simulation results show that the proposed models can correctly reflect the dynamic of node behavior, quickly identify the malicious attacks, and effectively avoid such path containing low-trust nodes so as to enhance the robustness.

The Sharing Economy: Rhetoric and Reality

2021 ◽  
Vol 47 (1) ◽  
Author(s):  
Juliet B. Schor ◽  
Steven P. Vallas
Keyword(s):  
Digital Technology ◽  
Sharing Economy ◽  
Environmental Benefits ◽  
Annual Review ◽  
Publication Date ◽  
Racial Inequalities ◽  
Carbon Footprints ◽  
Transformative Potential ◽  
Intellectual Foundations ◽  
User Trust

The sharing economy is transforming economies around the world, entering markets for lodging, ride hailing, home services, and other sectors that previously lacked robust person-to-person alternatives. Its expansion has been contentious and its meanings polysemic. It launched with a utopian discourse promising economic, social, and environmental benefits, which critics have questioned. In this review, we discuss its origins and intellectual foundations, internal tensions, and appeal for users. We then turn to impacts, focusing on efforts to generate user trust through digital means, tendency to reconfigure and exacerbate class and racial inequalities, and failure to reduce carbon footprints. Though the transformative potential of the sharing economy has been limited by commercialization and more recently by the pandemic, its kernel insight—that digital technology can support logics of reciprocity—retains its relevance even now. Expected final online publication date for the Annual Review of Sociology, Volume 47 is July 2021. Please see http://www.annualreviews.org/page/journal/pubdates for revised estimates.

A Relay Selection Algorithm Based on User Trust Degree for D2D Communications

2021 ◽  
Author(s):  
Xiaobin Li ◽  
Haoran Liu
Keyword(s):  
Success Rate ◽  
Social Relationship ◽  
Relay Node ◽  
D2d Communications ◽  
Relay Nodes ◽  
Trust Degree ◽  
Relay Communication ◽  
Relay Selection Algorithm ◽  
User Trust

Abstract The emergence of 5G has promoted the rapid development of the Internet of Things(IOT), the dramatic increasing of mobile equipment has led to the increasing shortage of spectrum resources, D2D(Device-to-Device) communication technology is widely concerned for its ability to improve the utilization of spectrum resources. In order to expand the communication scope, relay nodes are introduced into D2D communications, as the third party of D2D relay communication, the quality of relay nodes directly affects the quality of communication process. In order to make more users willing to participate in relay communication, social relationship is introduced into D2D relay communication, However, as an explicit relationship between people, the function of social relationship in D2D communication is limited by the mobility of users and the variability of communication scenarios. In order to find a more reli­able relay node and upgrade the connection success rate of D2D relay communication, implicit social relationship between the users need to be mined. Aiming at that, user trust degree (UTD) is established in this paper. By combining the explicit relationship which is called the social connectivity degree with the implicit social relationship called the interest similarity degree, and considering the user’s movement, a relay selection algorithm is presented to help sender find a relay node with a deeper user trust, which can increase the user’s willingness to participate in D2D relay communication and upgrade the success rate of communication connection, so this algorithm can ensure the security of the relay node and can improve the throughput performance. Simulation results show that this algorithm can increase the success rate of connection, improve the overall throughput of the system and improve the user's communication expe­rience.

scholarly journals Public Safety Risk Assessment of Power Investment Project Based on Fuzzy Set and DS Evidence Theory

2020 ◽  
Vol 143 ◽  
pp. 02009
Author(s):  
Tai-hua Yang ◽  
Jing Qin ◽  
Zhi-xiang Li
Keyword(s):  
Risk Assessment ◽  
Fuzzy Set ◽  
Public Safety ◽  
Evidence Theory ◽  
Investment Project ◽  
Public Security ◽  
Risk Level ◽  
Security Risk ◽  
Safety Risk ◽  
Assessment Index

In recent years, the international situation has become more and more complex, and the regional conflicts have been escalating, and the risks of overseas public security have been increasing. Based on the four types of public security events, a public safety risk assessment index system of "one belt and one road" electric power investment project is established. Combining the Bayesian network model, and using fuzzy set and DS evidence theory, the public security risk level of the “Belt and Road” countries can be this method has been effectively verified and put forward countermeasures by an example.

scholarly journals A New Evaluation Methodology for Quality Goals Extended by D Number Theory and FAHP

Information ◽  
2020 ◽  
Vol 11 (4) ◽  
pp. 206
Author(s):  
Hongming Mo
Keyword(s):  
Number Theory ◽  
Process Management ◽  
Evidence Theory ◽  
Evaluation Methodology ◽  
Uncertain Information ◽  
Mathematical Tool ◽  
Analytic Hierarchy ◽  
Multi Attribute Decision Making ◽  
Hierarchy Process ◽  
Evaluation Information

Evaluation of quality goals is an important issue in process management, which essentially is a multi-attribute decision-making (MADM) problem. The process of assessment inevitably involves uncertain information. The two crucial points in an MADM problem are to obtain weight of attributes and to handle uncertain information. D number theory is a new mathematical tool to deal with uncertain information, which is an extension of evidence theory. The fuzzy analytic hierarchy process (FAHP) provides a hierarchical way to model MADM problems, and the comparison analysis among attributes is applied to obtain the weight of attributes. FAHP uses a triangle fuzzy number rather than a crisp number to represent the evaluation information, which fully considers the hesitation to give a evaluation. Inspired by the features of D number theory and FAHP, a D-FAHP method is proposed to evaluate quality goals in this paper. Within the proposed method, FAHP is used to obtain the weight of each attribute, and the integration property of D number theory is carried out to fuse information. A numerical example is presented to demonstrate the effectiveness of the proposed method. Some necessary discussions are provided to illustrate the advantages of the proposed method.

A Dynamic Trust Evaluation Model for Internet Computing

2013 ◽  
Vol 397-400 ◽  
pp. 1949-1953 ◽  
Author(s):  
Feng Li ◽  
Ya Li Si
Keyword(s):  
Evaluation Model ◽  
Trust Model ◽  
Internet Security ◽  
Trust Evaluation ◽  
Trust Mechanism ◽  
Internet Computing ◽  
Trust Degree ◽  
Dynamic Trust ◽  
Simulation Results

Trust mechanism has been identified as one of key areas in the field of Internet security. Our objective in this paper is to develop a dynamic trust evaluation model for Internet computing. The proposed scheme divides the recommendation trust into the direct recommendation trust and the indirect recommendation trust, and considers variety of factors to calculate the two types of recommendation trust degree. Simulation results show that, compared to the existing trust model, the model can effectively improve the accuracy of trust evaluation, and provide a better capacity of resisting malicious entities.

scholarly journals A trust-based authentication framework for security of WPAN using network slicing

2021 ◽  
Vol 11 (2) ◽  
pp. 1375
Author(s):  
Sazia Parvin ◽  
Amjad Gawanmeh ◽  
Sitalakshmi Venkatraman ◽  
Ali Alwadi ◽  
Jamal N. Al-Karaki ◽  
...  
Keyword(s):  
New Technologies ◽  
Security And Privacy ◽  
Personal Area Networks ◽  
Wireless Personal Area Networks ◽  
Malicious Nodes ◽  
Network Slicing ◽  
Trust Value ◽  
Malicious Behavior ◽  
Mandatory Requirement ◽  
Novel Method

New technologies bring along many challenges including security and privacy. Wireless personal area networks (WPANs) are characterized by limited energy resources and computing power that calls for lightweight security mechanisms in these networks as a mandatory requirement. In this paper, a lightweight trust-based framework for node authentication in WPAN is proposed. Our main objective is to minimise the effort in distinguishing valid requests of trustworthy nodes from invalid requests of malicious nodes that can result in network compromises. We achieve this through network slicing which divides the network into virtually primary and secondary networks. The proposed framework has three-fold benefits. First, it authenticates nodes’ requests based on a novel method of trust value calculation. Second, the framework maintains energy efficiency while authenticating nodes’ requests to access WPAN resources. Finally, the framework provides a solution for biasing problem that can arise due to unexpected behaviour of malicious users in WPANs. The framework efficacy is illustrated on a case study to shown how it can accurately capture trust relations among nodes while preventing malicious behavior.

Sign in / Sign up

Export Citation Format

Share Document