Issue No.01 - Jan.-March (2012 vol.5)
Xiaofeng Wang , National University of Defense Technology, Changsha
Jinshu Su , The National University of Defense Technology,China, Changsha
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TSC.2010.56
Reputation-based trust systems provide important capability in open and service-oriented computing environments. Most existing trust models fail to assess the variance of a reputation prediction. Moreover, the summation method, widely used for reputation feedback aggregation, is vulnerable to malicious feedbacks. This paper presents a general trust model, called RLM, for a more comprehensive and robust reputation evaluation. Concretely, we define a comprehensive reputation evaluation method based on two attributes: reputation value and reputation prediction variance. The reputation predication variance serves as a quality measure of the reputation value computed based on aggregation of feedbacks. For feedback aggregation, we propose the novel Kalman aggregation method, which can inherently support robust trust evaluation. To defend against malicious and coordinated feedbacks, we design the Expectation Maximization algorithm to autonomously mitigate the influence of a malicious feedback, and further apply the hypothesis test method to resist malicious feedbacks precisely. Through theoretical analysis, we demonstrate the robustness of the RLM design against adulating and defaming attacks, two popular types of feedback attacks. Our experiments show that the RLM model can effectively capture the reputation's evolution and outperform the popular summation-based trust models in terms of both accuracy and attack resilience. Concretely, under the attack of collusive malicious feedbacks, RLM offers higher robustness for the reputation prediction and a lower false positive rate for the malicious feedback detection.
Trust model, accuracy assessment, malicious feedback, robustness.
Xiaofeng Wang, Jinshu Su, "RLM: A General Model for Trust Representation and Aggregation", IEEE Transactions on Services Computing, vol.5, no. 1, pp. 131-143, Jan.-March 2012, doi:10.1109/TSC.2010.56