Trust Evaluation Scheme Research Articles

Enhanced Weighted Trust Evaluation Scheme for Detection of Malicious Nodes in Wireless Sensor Networks

Enhanced Weighted Trust Evaluation Scheme for Detection of Malicious Nodes in Wireless Sensor Networks

Exploiting Secure and Energy-Efficient Collaborative Spectrum Sensing for Cognitive Radio Sensor Networks

Cognitive radio sensor network (CRSN) has emerged as a promising solution to address the spectrum scarcity problem in traditional sensor networks, by enabling sensor nodes to opportunistically access licensed spectrum. To protect the transmission of primary users and enhance spectrum utilization, collaborative spectrum sensing is generally adopted for improving spectrum sensing accuracy. However, as sensor nodes may be compromised by adversaries, these nodes can send false sensing reports to mislead the spectrum sensing decision, making CRSNs vulnerable to spectrum sensing data falsification (SSDF) attacks. Meanwhile, since the energy consumption of spectrum sensing is considerable for energy-limited sensor nodes, SSDF attack countermeasures should be carefully devised with the consideration of energy efficiency. To this end, we propose a secure and energy-efficient collaborative spectrum sensing scheme to resist SSDF attacks and enhance the energy efficiency in CRSNs. Specifically, we theoretically analyze the impacts of two types of attacks, i.e., independent and collaborative SSDF attacks, on the accuracy of collaborative spectrum sensing in a probabilistic way. To maximize the energy efficiency of spectrum sensing, we calculate the minimum number of sensor nodes needed for spectrum sensing to guarantee the desired accuracy of sensing results. Moreover, a trust evaluation scheme, named FastDtec, is developed to evaluate the spectrum sensing behaviors and fast identify compromised nodes. Finally, a secure and energy-efficient collaborative spectrum sensing scheme is proposed to further improve the energy efficiency of collaborative spectrum sensing, by adaptively isolating the identified compromised nodes from spectrum sensing. Extensive simulation results demonstrate that our proposed scheme can resist SSDF attacks and significantly improve the energy efficiency of collaborative spectrum sensing.

Dominating Set Algorithm and Trust Evaluation Scheme for Secured Cluster Formation and Data Transferring

Dominating Set Algorithm and Trust Evaluation Scheme for Secured Cluster Formation and Data Transferring

Trust Evaluation in Online Social Networks Using Generalized Network Flow

In online social networks (OSNs), to evaluate trust from one user to another indirectly connected user, the trust evidence in the trusted paths (i.e., paths built through intermediate trustful users) should be carefully treated. Some paths may overlap with each other, leading to a unique challenge of path dependence , i.e., how to aggregate the trust values of multiple dependent trusted paths. OSNs bear the characteristic of high clustering, which makes the path dependence phenomenon common. Another challenge is trust decay through propagation, i.e., how to propagate trust along a trusted path, considering the possible decay in each node. We analyze the similarity between trust propagation and network flow, and convert a trust evaluation task with path dependence and trust decay into a generalized network flow problem. We propose a modified flow-based trust evaluation scheme GFTrust , in which we address path dependence using network flow, and model trust decay with the leakage associated with each node. Experimental results, with the real social network data sets of Epinions and Advogato, demonstrate that GFTrust can predict trust in OSNs with a high accuracy, and verify its preferable properties.

소셜 시맨틱 웹 환경에서 프로버넌스 기반의 웹 데이터 신뢰도 평가 기법

최근 사용자들 사이의 웹 데이터의 생성 및 공유가 활발해 지면서 시맨틱 웹과 소셜 웹이 결합한 소셜 시맨틱 웹에 대한 중요성이 증가되고 있다. 본 논문은 소셜 시맨틱 웹 환경에서 PROV 모델을 확장하여 프로버넌스 기반의 웹 데이터 신뢰성 평가 기법을 제안한다. 제안하는 기법은 소셜 시맨틱 웹환경에서 웹 데이터의 프로버넌스를 관리하고 신뢰성 평가를 위해 W3C의 PROV 모델에 필요한 요소를 추가하였다. 이와 같이 확장된 PROV 모델은 웹 데이터의 관리 및 프로버넌스 추적을 지원한다. 제안하는 신뢰성 평가 기법은 사용자의 신뢰도, 원본 데이터의 신뢰도 그리고 사람들의 평가 등과 같은 다양한 파라미터를 고려한다. 평가된 신뢰도는 프로버넌스 정보로 관리되고 사용자의 질의를 처리할 때 이 신뢰도를 고려하여 결과를 생성한다. 따라서 제안하는 기법은 소셜 시맨틱 웹 데이터의 프로버넌스를 관리할 수 있고 다양한 파라미터를 이용하여 웹 데이터 신뢰도를 정확하게 계산할 수 있다. 평가된 신뢰도는 사용자가 질의 결과의 신뢰 여부를 판단할 수 있는 기준이 된다. 제안하는 기법의 타당성을 보이기 위해 SPARQL 질의를 이용하여 신뢰성 평가의 성능을 검증한다.

A trust evaluation scheme for complex links in a social network: a link strength perspective

Potential security threats pose a significant challenge to evaluating the trustworthiness of complex links among users in a social network. Traditional trust computation methods typically consider user comments or interaction, thereby reflecting the trustworthiness between users according to their past experiences. However, the tie strength, which reflects the closeness of user relationships, is also a potential factor for estimating the trustworthiness of links among users. To incorporate this indicator, we propose a trust evaluation scheme for complex links comprising two aspects: the reliability and strength of links among uses. Our main contributions are (1) a trust calculation method, including direct trust for directly linked users and indirect trust for indirectly linked users, which is established based on the comment factor, forwarding factor, and approving factor; (2) a link strength evaluation method to determine the trustworthiness of direct and indirect links between users considering comment stability, mutual trust, interaction frequency, and common neighbours and community similarity, and (3) a link trust evaluation algorithm based on the link trust matrix synthesizing the reliability and strength of links. The experimental results and analysis show that our proposed scheme is feasible and effective in improving the performance of trust evaluation in a social network.

Optimising on trust value-based clustering using trust evaluation scheme for ad hoc network

In ad hoc networks, routing and security are a very challenging task due to their peculiar characteristics. Among various routing schemes and providing security for optimising on trust value-based clustering using trust evaluation scheme CTES for ad hoc network is based on an efficient trust model. This algorithm aims to elect trustworthy cluster heads that can provide secure communication via cooperative nodes and is used to settle down many secured applications in ad hoc networks. Thus, the trust level of a node must be dynamically taken into consideration in the parameter used for cluster head election. Furthermore, nodes energy, mobility, distance to neighbours and connectivity degree are also used for cluster heads election to make CTES result in a trustworthy, stable and high-energy cluster heads. Simulations were conducted to evaluate trusted cluster heads in terms of cluster stability, packet delivery ratio and an average end to end delivery.

소셜 네트워크에서 원거리 노드를 고려한 동적 사용자 신뢰도 평가 스킴

ABSTRACT The social network service is the bidirectional media that many users can build relations not only friends but also other people. However, a process to approach in the social network is so simple that untrustable information, which malignant users make, is spreaded rapidly in many the social network uses. This causes many users to suffer material or psychological damages. Because of openness in the social network, there will be higher risk of the privacy invasion. Therefore, sensitive information should be transferred or provided only to reliable users. In ge neral, because many users exchange among one hops, many researches have focused on one hop’s trust evaluation. However, exchanges between users happen not only one joint bridege but also far nodes more than two nodes on account of dense network and openness. In this paper we propose the efficient scheme combining transitivity and composability for remote users Keywords: Trust Evaluation Scheme, Transitivity, Composability, Social Network Service접수일(2013년 12월 31일), 수정일(2014년 4월 8일),게재확정일(2014년 4월 8일)* 본 연구는 미래창조과학부 및 정보통신산업진흥원의 대학 IT연구센터육성 지원사업의 연구결과로 수행되었음.(NIPA-2014-H0301-14-1004)†주저자, ykim@security.re.kr‡교신저자,dhwon@security.re.kr(Corresponding author)

Prevention and Trust Evaluation Scheme Based on Interpersonal Relationships for Large-Scale Peer-To-Peer Networks

In recent years, the complex network as the frontier of complex system has received more and more attention. Peer-to-peer (P2P) networks with openness, anonymity, and dynamic nature are vulnerable and are easily attacked by peers with malicious behaviors. Building trusted relationships among peers in a large-scale distributed P2P system is a fundamental and challenging research topic. Based on interpersonal relationships among peers of large-scale P2P networks, we present prevention and trust evaluation scheme, called IRTrust. The framework incorporates a strategy of identity authentication and a global trust of peers to improve the ability of resisting the malicious behaviors. It uses the quality of service (QoS), quality of recommendation (QoR), and comprehensive risk factor to evaluate the trustworthiness of a peer, which is applicable for large-scale unstructured P2P networks. The proposed IRTrust can defend against several kinds of malicious attacks, such as simple malicious attacks, collusive attacks, strategic attacks, and sybil attacks. Our simulation results show that the proposed scheme provides greater accuracy and stronger resistance compared with existing global trust schemes. The proposed scheme has potential application in secure P2P network coding.

Trust-based authentication routing protocol for satellite network

Security routing protocol is a key element to guarantee satellite network security.To solve the problem that most of routing protocols lack security scheme,the Elliptic Curve Pintsov-Vanstone Signature Scheme(ECPVSS) was used to attain confidentiality and authentication of packets,and trust evaluation scheme could exclude internal malicious node from the route path.Then a security routing protocol oriented to High Altitude Platform(HAP)/Low Earth Orbit(LEO) architecture was formed.The analysis results show that the proposed protocol can prevent network from some common routing attacks.

Cluster-Based Trust Evaluation Scheme in an Ad Hoc Network

This paper presents a new trust evaluation scheme in an ad hoc network. To overcome the limited information about unfamiliar nodes and to reduce the required memory space, we propose a cluster-based trust evaluation scheme, in which neighboring nodes form a cluster and select one node as a cluster head. The head issues a trust value certificate that can be referred to by its non-neighbor nodes. In this way, an evaluation of an unfamiliar node's trust can be done very efficiently and precisely. In this paper, we present a trust evaluation metric using this scheme and some operations for forming and managing a cluster. An analysis of the proposed scheme over some security problems is also presented. node. Based on the evaluated trust, security measures are taken, or security decisions are made. In the previous schemes of trust evaluation (2), (3), each node has to evaluate the trust of every other node in the network. It is quite difficult for a node to evaluate accurately the trust of the nodes of which it has little interaction. Furthermore, these schemes require a great deal of memory space to store each of the other node's trust value. Such constraining of resources in an ad hoc network is a severe problem.