This Article 
 Bibliographic References 
 Add to: 
Iterative Trust and Reputation Management Using Belief Propagation
May/June 2012 (vol. 9 no. 3)
pp. 375-386
Erman Ayday, Georgia Institute of Technology, Atlanta
Faramarz Fekri, Georgia Institute of Technology, Atlanta
In this paper, we introduce the first application of the belief propagation algorithm in the design and evaluation of trust and reputation management systems. We approach the reputation management problem as an inference problem and describe it as computing marginal likelihood distributions from complicated global functions of many variables. However, we observe that computing the marginal probability functions is computationally prohibitive for large-scale reputation systems. Therefore, we propose to utilize the belief propagation algorithm to efficiently (in linear complexity) compute these marginal probability distributions; resulting a fully iterative probabilistic and belief propagation-based approach (referred to as BP-ITRM). BP-ITRM models the reputation system on a factor graph. By using a factor graph, we obtain a qualitative representation of how the consumers (buyers) and service providers (sellers) are related on a graphical structure. Further, by using such a factor graph, the global functions factor into products of simpler local functions, each of which depends on a subset of the variables. Then, we compute the marginal probability distribution functions of the variables representing the reputation values (of the service providers) by message passing between nodes in the graph. We show that BP-ITRM is reliable in filtering out malicious/unreliable reports. We provide a detailed evaluation of BP-ITRM via analysis and computer simulations. We prove that BP-ITRM iteratively reduces the error in the reputation values of service providers due to the malicious raters with a high probability. Further, we observe that this probability drops suddenly if a particular fraction of malicious raters is exceeded, which introduces a threshold property to the scheme. Furthermore, comparison of BP-ITRM with some well-known and commonly used reputation management techniques (e.g., Averaging Scheme, Bayesian Approach, and Cluster Filtering) indicates the superiority of the proposed scheme in terms of robustness against attacks (e.g., ballot stuffing, bad mouthing). Finally, BP-ITRM introduces a linear complexity in the number of service providers and consumers, far exceeding the efficiency of other schemes.

[1] S. Buchegger and J. Boudec, "Performance Analysis of Confidant Protocol (Coorperation of Nodes: Fairness in Dynamic Ad-Hoc Networks)," Proc. IEEE/ACM Symp. Mobile Ad Hoc Networking and Computing (MobiHOC), June 2002.
[2] S. Buchegger and J. Boudec, "A Robust Reputation System for P2P and Mobile Ad-Hoc Networks," Proc. Second Workshop the Economics of Peer-to-Peer Systems, 2004.
[3] S. Ganeriwal and M. Srivastava, "Reputation-Based Framework for High Integrity Sensor Networks," Proc. Second ACM Workshop Security of Ad Hoc and Sensor Networks (SASN '04), pp. 66-77, 2004.
[4] Y. Sun, W. Yu, Z. Han, and K. Liu, "Information Theoretic Framework of Trust Modeling and Evaluation for Ad Hoc Networks," IEEE J. Selected Areas in Comm., vol. 24, no. 2, pp. 305-317, Feb. 2006.
[5] H. Pishro-Nik and F. Fekri, "On Decoding of Low-Density Parity-Check Codes on the Binary Erasure Channel," IEEE Trans. Information Theory, vol. 50, no. 3, pp. 439-454, Mar. 2004.
[6] H. Pishro-Nik and F. Fekri, "Results on Punctured Low-density Parity-Check Codes and Improved Iterative Decoding Techniques," IEEE Trans. Information Theory, vol. 53, no. 2, pp. 599-614, Feb. 2007.
[7] B.N. Vellambi and F. Fekri, "Results on the Improved Decoding Algorithm for Low-Density Parity-Check Codes over the Binary Erasure Channel," IEEE Trans. Information Theory, vol. 53, no. 4, pp. 1510-1520, Apr. 2007.
[8] E. Ayday, H. Lee, and F. Fekri, "An Iterative Algorithm for Trust and Reputation Management," Proc. IEEE Int'l Symp. Information Theory (ISIT '09), 2009.
[9] J. Pearl, Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. Morgan Kaufmann, 1988.
[10] F. Kschischang, B. Frey, and H.A. Loeliger, "Factor Graphs and the Sum-Product Algorithm," IEEE Trans. Information Theory, vol. 47, no. 2, pp. 498-519, Feb. 2001.
[11] J. Zhang and M. Fossorier, "Shuffled Belief Propagation Decoding," Proc. 36th Asilomar Conf. Signals, Systems and Computers, Nov. 2002.
[12] E. Ayday, H. Lee, and F. Fekri, "Trust Management and Adversary Detection in Delay Tolerant Networks," Proc. IEEE Military Comm. Conf. (MILCOM '10), 2010.
[13] Y. Liu, A.H. Ngu, and L.Z. Zeng, "Qos Computation and Policing in Dynamic Web Service Selection," Proc. 13th Int'l World Wide Web Conf. Alternate Track Papers & Posters (WWW Alt. '04), pp. 66-73, 2004.
[14] U.S. Manikrao and T.V. Prabhakar, "Dynamic Selection of Web Services with Recommendation System," Proc. Int'l Conf. Next Generation Web Services Practices (NWESP '05), p. 117, 2005.
[15] E.M. Maximilien and M.P. Singh, "Conceptual Model of Web Service Reputation," SIGMOD Record, vol. 31, no. 4, pp. 36-41, 2002.
[16] E.M. Maximilien and M.P. Singh, "Toward Autonomic Web Services Trust and Selection," Proc. Second Int'l Conf. Service Oriented Computing (ICSOC '04), pp. 212-221, 2004.
[17] E.M. Maximilien and M.P. Singh, "Multiagent System for Dynamic Web Services Selection," Proc. First Workshop Service-Oriented Computing and Agent-Based Eng., 2005.
[18] K. Aberer and Z. Despotovic, "Managing Trust in a Peer-2-Peer Information System," Proc. Tenth Int'l Conf. Information and Knowledge Management (CIKM '01), pp. 310-317, 2001.
[19] F. Cornelli, E. Damiani, S.D.C. di Vimercati, S. Paraboschi, and P. Samarati, "Choosing Reputable Servents in a P2P Network," Proc. 11th Int'l Conf. World Wide Web (WWW '02), pp. 376-386, 2002.
[20] E. Damiani, D.C. di Vimercati, S. Paraboschi, P. Samarati, and F. Violante, "A reputation-Based Approach for choosing Reliable Resources in Peer-to-Peer Networks," Proc. Ninth ACM Conf. Computer and Comm. Security (CCS '02), pp. 207-216, 2002.
[21] D. Fahrenholtz and W. Lamersdorf, "Transactional Security for a Distributed Reputation Management System," Proc. Third Int'l Conf. E-Commerce and Web Technologies (EC-WEB '02), pp. 214-223, 2002.
[22] M. Gupta, P. Judge, and M. Ammar, "A Reputation System for Peer-to-Peer Networks," Proc. 13th Int'l Workshop Network and Operating Systems Support for Digital Audio and Video (NOSSDAV '03), pp. 144-152, 2003.
[23] S.D. Kamvar, M.T. Schlosser, and H. Garcia-Molina, "The Eigentrust Algorithm for Reputation Management in P2P Networks," Proc. 12th Int'l Conf. World Wide Web (WWW '03), pp. 640-651, 2003.
[24] C.-W. Hang, Y. Wang, and M.P. Singh, "An Adaptive Probabilistic Trust Model and Its Evaluation," Proc. Seventh Int'l Joint Conf. Autonomous Agents and Multiagent Systems (AAMAS '08), vol. 3, pp. 1485-1488, 2008.
[25] Y. Wang and M.P. Singh, "Evidence-Based Trust: A Mathematical Model Geared for Multiagent Systems," ACM Trans. Autonomous and Adaptive Systems, vol. 5, pp. 14:1-14:28, Nov. 2010.
[26] L. Page, S. Brin, R. Motwani, and T. Winograd, "The Pagerank Citation Ranking: Bringing Order to the Web," technical report, Stanford Digital Library Technologies Project, 1998.
[27] S. Buchegger and J. Boudec, "Coping with False Accusations in Misbehavior Reputation Systems for Mobile Ad Hoc Networks," Technical Report IC/2003/31, EPFL-DI-ICA, 2003.
[28] G. Zacharia, A. Moukas, and P. Maes, "Collaborative Reputation Mechanisms in Electronic Marketplaces," Proc. 32nd Ann. Hawaii Int'l Conf. System Sciences (HICSS '99), 1999.
[29] C. Dellarocas, "Immunizing Online Reputation Reporting Systems against Unfair Ratings and Discriminatory Behavior," Proc. Second ACM Conf. Electronic Commerce (EC '00), pp. 150-157, 2000.
[30] P. Resnick and R. Zeckhauser, "Trust among Strangers in Internet Transactions: Empirical Analysis of eBay's Reputation System," Proc. Workshop Empirical Studies of Electronic Commerce, 2002.
[31] J.M. Pujol, R. Sangüesa, and J. Delgado, "Extracting Reputation in Multi Agent Systems by Means of Social Network Topology," Proc. First Int'l Joint Conf. Autonomous Agents and Multiagent Systems (AAMAS '02), pp. 467-474, 2002.
[32] P. Yolum and P. Singh, "Self-Organizing Referral Networks: A Process View of Trust and Authority," First Int'l Workshop Eng. Self-Organising Applications (ESOA '03), July 2003.
[33] A. Whitby, A. Josang, and J. Indulska, "Filtering Out Unfair Ratings in Bayesian Reputation Systems," Proc. Seventh Int'l Workshop Trust in Agent Societies (AAMAS '04), 2004.
[34] P. Macnaughton-Smith, W.T. Williams, M.B. Dale, and L.G. Mockett, "Dissimilarity Analysis: A New Technique of Hierarchical Sub-Division," Nature, vol. 202, pp. 1034-1035, 1964.
[35] D. Goldberg, D. Nichols, B.M. Oki, and D. Terry, "Using Collaborative Filtering to Weave an Information Tapestry," Comm. ACM, vol. 35, pp. 61-70, Dec. 1992.
[36] P. Resnick, N. Iacovou, M. Suchak, P. Bergstrom, and J. Riedl, "GroupLens: An Open Architecture for Collaborative Filtering of Netnews," Proc. ACM Conf. Computer Supported Cooperative Work (CSCW '94), pp. 175-186, 1994.
[37] J. Herlocker, J.A. Konstan, and J. Riedl, "An Empirical Analysis of Design Choices in Neighborhood-Based Collaborative Filtering Algorithms," Information Retrieval, vol. 5, no. 4, pp. 287-310, 2002.
[38] B.M. Sarwar, G. Karypis, J.A. Konstan, and J.T. Riedl, "Application of Dimensionality Reduction in Recommender System—A Case Study," Proc. ACM WebKDD Web Mining ECommerce Workshop, 2000.
[39] G. Shafer, A Mathematical Theory of Evidence. Princeton Univ. Press, 1976.
[40] G. Shafer, "The Dempster-Shafer Theory," Encyclopedia of Artificial Intelligence, 1992.
[41] F. Slanina and Y.C. Zhang, "Referee Networks and Their Spectral Properties," Acta Physica Polonica B, vol. 36, p. 2797, Sep. 2005.
[42] Y. Yang, Q. Feng, Y.L. Sun, and Y. Dai, "RepTrap: a Novel Attack on Feedback-Based Reputation Systems," Proc. Fourth Int'l Conf. Security and Privacy in Comm. Networks (Secure Comm '08), pp. 1-11, 2008.
[43] J. Chen, A. Dholakia, E. Eleflhetiou, M. Fossotier, and X.-Y. Hu, "Near Optimum Reduced-Complexity Decoding Algonhm for LDPC Codes," Proc. IEEE Int'l Symp. Information Theory, July 2002.

Index Terms:
Trust and reputation management, belief propagation, iterative algorithms, bad mouthing, ballot stuffing, online services, e-commerce.
Erman Ayday, Faramarz Fekri, "Iterative Trust and Reputation Management Using Belief Propagation," IEEE Transactions on Dependable and Secure Computing, vol. 9, no. 3, pp. 375-386, May-June 2012, doi:10.1109/TDSC.2011.64
Usage of this product signifies your acceptance of the Terms of Use.