• ETRI Journal
• /
• v.27 no.4
• /
• pp.465-468
• /
• 2005

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.

• Journal of KIISE
• /
• v.43 no.1
• /
• pp.106-118
• /
• 2016

Recently, as the generation and sharing of web data have increased, the importance of a social semantic web that combines the semantic web and the social web has also been increasing. In this paper, we propose a trust evaluation scheme based on provenance by extending the PROV model in the social semantic web environment. The proposed scheme manages the provenance of web data and adds the necessary elements for trust evaluation in the PROV model of W3C. The extended PROV model supports data management and provenance tracing. The proposed trust evaluation scheme considers various parameters such as user trust, original data trust, and user evaluation. The evaluated trust is managed as provenance. When processing a query, the proposed scheme generates a result by considering the trust. Therefore, the proposed scheme can manage the provenance of web data and compute data trust correctly by using such various parameters. The evaluated trust becomes a criterion to determine whether the query result can be trusted or not. In order to show the validity of the proposed scheme, we verify its performance using SPARQL queries.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.5
• /
• pp.2396-2413
• /
• 2018

Trust management is one of the most challenging issues for the highly heterogeneous Internet of Things (IoT). In the context of the IoT, it is difficult to evaluate the node's trustworthiness in the same trust model when a node provides different services. Guaranteeing the availability of the trust management service is another significant challenge because of the dynamic nature of IoT environments. With these issues in mind, this paper propose a robust and adaptive trust management system for the IoT that is able to measure the trustworthiness of nodes based on feedbacks collected from participants in a specific context and ensure the availability of trust management services. The main contributions of our system are: 1) Proposing a partly decentralized trust management framework, which improves the resiliency of the trust mechanism; 2) Proposing an adaptive trust evaluation scheme and a three-dimensional context representation makes trust evaluation more accurate and specific; 3) Enhancing the adaptive trust evaluation scheme by incorporating a bad behavior factor in trust estimation, which efficiently distinguishes misleading feedbacks from On-Off attacks. Simulation results show the good performance of the proposed system and especially show effectiveness against On-Off attacks compared to other trust mechanisms.

• ETRI Journal
• /
• v.32 no.2
• /
• pp.348-350
• /
• 2010

This letter presents an enhancement of EigenTrust. Using the beta distribution, local trust values can be more correctly evaluated. Simulation shows that the proposed scheme calculates the local trust more correctly by up to 8%. For personalization, the proposed scheme provides cumulative transitive values from the local trust to the global trust with mathematically guaranteed convergence.

• The Journal of the Korea Contents Association
• /
• v.21 no.3
• /
• pp.68-79
• /
• 2021

On the Social Internet of Things (SIoT), social activities occur through which the vehicle generates a variety of data, shares them with other vehicles, and sends and receives feedbacks. In order to share reliable information between vehicles, it is important to determine the reliability of a vehicle. In this paper, we propose a vehicle trust evaluation scheme to share reliable information among vehicles. The proposed scheme calculates vehicle trust by considering user reputation and network trust based on inter-vehicle social behaviors. The vehicle may choose to scoring, ignoring, redistributing, etc. in the social activities inter vehicles. Thereby, calculating the user's reputation. To calculate network trust, distance from other vehicles and packet transmission rate are used. Using user reputation and network trust, local trust is calculated. It also prevents redundant distribution of data delivered during social activities. Data from the Road Side Unit (RSU) can be used to overcome local data limitations and global data can be used to calculate a vehicle trust more accurately. It is shown through various performance evaluations that the proposed scheme outperforms the existing schemes.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.4 no.1
• /
• pp.33-40
• /
• 2008

This paper presents a new scheduling scheme in wireless distributed network. To overcome the limited information about unfamiliar mobile nodes and to reduce the required system performance, we propose a scheduling algorithm of job allocation based on the trust model. The suggested scheduler evaluate an unfamiliar mobile node's trust and make reference to the trust value of neighboring scheduler. This scheduling algorithm can avoid malicious or selfish mobile nodes by assigning low trust values. We also present a trust evaluation metric and show the efficiency of suggested scheduling algorithm by performance evaluation.

• The Journal of the Korea Contents Association
• /
• v.17 no.1
• /
• pp.662-672
• /
• 2017

Recently, with the development of mobile devices and near field communication, mobile P2P networks have been actively studied to improve the limits of the existing centralized processing system. A peer has limited components such as batteries, memory and storage spaces in mobile P2P networks. The trust of a peer should be discriminated in order to share reliable contents in mobile P2P networks. In this paper, we propose a trust discrimination scheme considering limited resources in mobile P2P environments. The proposed scheme discriminates the trust of a peer by direct rating values using the rating information of the peer and indirect rating values by the other peers. The recent update time is included in the rating information. The proposed scheme reduces the redundant rating information by comparing the recent update times of the rating information. It is shown through performance evaluation that the proposed scheme reduces the number of messages and improves the accuracy of trust over the existing scheme.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.23 no.2
• /
• pp.157-168
• /
• 2013

The social network service is the bidirectional media that all of the users are be able to directly produce, process, and distribute the information without distinction of the producer and consumer. Over increasing the users rapidly, the users are be able to obtain and share the various information, but the problems occur due to the spread of unreliable information on the service. Moreover, it is spreading the problems violating the privacy and decreasing the reliability of the users by exploiting the open environment. Therefore, sensitive information can be delivered only to users which information producer can trust, and the users should get the information from the trustworthy users. Due to this necessity, it needs the efficient method can evaluates the reliability of the users. In this paper, we define the reliability in the service, make the trust parameter by using the function of the service, and propose the dynamic user reliability evaluation scheme evaluating the reliability of users. We draw the trust range on the reliability of users by analyzing the proposed reliability evaluation scheme.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.16 no.10
• /
• pp.3438-3457
• /
• 2022

As location-based services (LBS) are widely used in vehicular ad-hoc networks (VANETs), location privacy has become an utmost concern. Spatial cloaking is a popular location privacy protection approach, which uses a cloaking area containing k-1 collaborative vehicles (CVs) to replace the real location of the requested vehicle (RV). However, all CVs are assumed as honest in k-anonymity, and thus giving opportunities for dishonest CVs to submit false location information during the cloaking area construction. Attackers could exploit dishonest CVs' false location information to speculate the real location of RV. To suppress this threat, an edge-assisted Trusted Collaborative Anonymity construction scheme called TCA is proposed with trust mechanism. From the design idea of trusted observations within variable radius r, the trust value is not only utilized to select honest CVs to construct a cloaking area by restricting r's search range but also used to verify false location information from dishonest CVs. In order to obtain the variable radius r of searching CVs, a multiple linear regression model is established based on the privacy level and service quality of RV. By using the above approaches, the trust relationship among vehicles can be predicted, and the most suitable CVs can be selected according to RV's preference, so as to construct the trusted cloaking area. Moreover, to deal with the massive trust value calculation brought by large quantities of LBS requests, edge computing is employed during the trust evaluation. The performance analysis indicates that the malicious response of TCA is only 22% of the collaborative anonymity construction scheme without trust mechanism, and the location privacy leakage is about 32% of the traditional Enhanced Location Privacy Preserving (ELPP) scheme.

• Journal of KIISE:Information Networking
• /
• v.35 no.1
• /
• pp.76-90
• /
• 2008

Wireless sensor networks are expected to play a vital role in the upcoming age of ubiquitous computing such as home environmental, industrial, and military applications. Compared with the vivid utilization of the sensor networks, however, security and privacy issues of the sensor networks are still in their infancy because unique challenges of the sensor networks make it difficult to adopt conventional security policies. Especially, node compromise is a critical threat because a compromised node can drain out the finite amount of energy resources in battery-powered sensor networks by launching various insider attacks such as a false data injection. Even cryptographic authentication mechanisms and key management schemes cannot suggest solutions for the real root of the insider attack from a compromised node. In this paper, we propose a novel trust-based secure aggregation scheme which identifies trustworthiness of sensor nodes and filters out false data of compromised nodes to make resilient sensor networks. The proposed scheme suggests a defensible approach against the insider attack beyond conventional cryptographic solutions. The analysis and simulation results show that our aggregation scheme using trust evaluation is more resilient alternative to median.