The DOI matches its Crossref record; 66 of the 66 references it cites were found in a registry or an index.
A survey of attack and defense techniques for reputation systems
Abstract
Reputation systems provide mechanisms to produce a metric encapsulating reputation for a given domain for each identity within the system. These systems seek to generate an accurate assessment in the face of various factors including but not limited to unprecedented community size and potentially adversarial environments. We focus on attacks and defense mechanisms in reputation systems. We present an analysis framework that allows for the general decomposition of existing reputation systems. We classify attacks against reputation systems by identifying which system components and design choices are the targets of attacks. We survey defense mechanisms employed by existing reputation systems. Finally, we analyze several landmark systems in the peer-to-peer domain, characterizing their individual strengths and weaknesses. Our work contributes to understanding (1) which design components of reputation systems are most vulnerable, (2) what are the most appropriate defense mechanisms and (3) how these defense mechanisms can be integrated into existing or future reputation systems to make them resilient to attacks.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
The Market for "Lemons": Quality Uncertainty and the Market Mechanism
Akerlof, G. A. (1970) · The Quarterly Journal of Economics · doi:10.2307/1879431 · Cited by 23,016
Adhi Harmoko, S., M.Komp, Jacquard, J. M., Zuse, K., & Eniac (2005) · Cited by 18,035
Rayward-Smith, V. J. (1991) · Journal of the Operational Research Society · doi:10.1057/jors.1991.155 · Cited by 16,821
(1999) · Cited by 12,854
Chord: A scalable peer-to-peer lookup service for internet applications
Stoica, I., Morris, R., Karger, D., Kaashoek, M. F., & Balakrishnan, H. (2001) · Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications · doi:10.1145/383059.383071 · Cited by 9,623
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems
Rowstron, A., & Druschel, P. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-45518-3_18 · Cited by 7,276
A scalable content-addressable network
Ratnasamy, S., Francis, P., Handley, M., Karp, R., & Shenker, S. (2001) · Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications · doi:10.1145/383059.383072 · Cited by 6,372
Proceedings of the 19th International Joint Conference on Artificial Intelligence
Pujol, J. M., Delgado, J., Ramon Sangüesa, A., & Flache, A. (2005) · International Joint Conference on Artificial Intelligence · Cited by 5,771
Douceur, J. R. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-45748-8_24 · Cited by 4,419 · cited 6×
“However, even if source data is authenticated, selfpromotion attacks are possible if disparate identities or a single physical identity acquiring multiple identities through a Sybil attack [41] collude to promote each other.”
BackgroundInfluentialPolynomial Codes Over Certain Finite Fields
Reed, I. S., & Solomon, G. (1960) · Journal of the Society for Industrial and Applied Mathematics · doi:10.1137/0108018 · Cited by 3,662
The Digitization of Word of Mouth: Promise and Challenges of Online Feedback Mechanisms
Dellarocas, C. (2003) · Management Science · doi:10.1287/mnsc.49.10.1407.17308 · Cited by 3,433
The EigenTrust algorithm for reputation management in P2P networks
Kamvar, S. D., Schlosser, M. T., & Garcia-Molina, H. (2003) · Proceedings of the twelfth international conference on World Wide Web - WWW '03 · doi:10.1145/775152.775242 · Cited by 3,362
A survey of trust and reputation systems for online service provision
Jøsang, A., Ismail, R., & Boyd, C. (2007) · Decision Support Systems · doi:10.1016/j.dss.2005.05.019 · Cited by 3,330
Ba, S., & Pavlou, P. A. (2002) · Cited by 2,256
Resnick, P., Kuwabara, K., Zeckhauser, R., & Friedman, E. (2000) · Communications of the ACM · doi:10.1145/355112.355122 · Cited by 2,190
Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and Routing
Zhao, B. Y., Kubiatowicz, J. D., & Joseph, A. D. (2001) · Cited by 2,146
Core: A Collaborative Reputation Mechanism to Enforce Node Cooperation in Mobile Ad Hoc Networks
Michiardi, P., & Molva, R. (2002) · IFIP Advances in Information and Communication Technology · doi:10.1007/978-0-387-35612-9_9 · Cited by 1,625
Adar, E., & Huberman, B. A. (2000) · First Monday · doi:10.5210/fm.v5i10.792 · Cited by 1,527
Propagation of trust and distrust
Guha, R., Kumar, R., Raghavan, P., & Tomkins, A. (2004) · Proceedings of the 13th international conference on World Wide Web · doi:10.1145/988672.988727 · Cited by 1,464
The value of reputation on eBay: A controlled experiment
Resnick, P., Zeckhauser, R., Swanson, J., & Lockwood, K. (2006) · Experimental Economics · doi:10.1007/s10683-006-4309-2 · Cited by 1,118
Managing trust in a peer-2-peer information system
Aberer, K., & Despotovic, Z. (2001) · Proceedings of the tenth international conference on Information and knowledge management · doi:10.1145/502585.502638 · Cited by 917
Managing trust in a peer-2-peer information system
Aberer, K., & Despotovic, Z. (2001) · Proceedings of the tenth international conference on Information and knowledge management - CIKM'01 · doi:10.1145/502636.502638 · Cited by 915
Zimmermann, P. R. (1996) · Cited by 889
Matei, R., Iamnitchi, A., & Foster, P. (2002) · IEEE Internet Computing · doi:10.1109/4236.978369 · Cited by 766
Secure routing for structured peer-to-peer overlay networks
Castro, M., Druschel, P., Ganesh, A., Rowstron, A., & Wallach, D. S. (2002) · ACM SIGOPS Operating Systems Review · doi:10.1145/844128.844156 · Cited by 743
PowerTrust: A Robust and Scalable Reputation System for Trusted Peer-to-Peer Computing
Zhou, R., & Hwang, K. (2007) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/tpds.2007.1021 · Cited by 728
SybilGuard: defending against sybil attacks via social networks
Yu, H., Kaminsky, M., Gibbons, P. B., & Flaxman, A. (2006) · ACM SIGCOMM Computer Communication Review · doi:10.1145/1151659.1159945 · Cited by 725
Reputation in Auctions: Theory, and Evidence from e Bay
Houser, D., & Wooders, J. (2006) · Journal of Economics & Management Strategy · doi:10.1111/j.1530-9134.2006.00103.x · Cited by 677
Valuation of trust in open networks
Beth, T., Borcherding, M., & Klein, B. (1994) · Lecture Notes in Computer Science · doi:10.1007/3-540-58618-0_53 · Cited by 652
A reputation-based approach for choosing reliable resources in peer-to-peer networks
Damiani, E., di Vimercati, D. C., Paraboschi, S., Samarati, P., & Violante, F. (2002) · Proceedings of the 9th ACM conference on Computer and communications security · doi:10.1145/586110.586138 · Cited by 605
SybilLimit: A Near-Optimal Social Network Defense against Sybil Attacks
Yu, H., Gibbons, P. B., Kaminsky, M., & Xiao, F. (2008) · 2008 IEEE Symposium on Security and Privacy (sp 2008) · doi:10.1109/sp.2008.13 · Cited by 563
Robust incentive techniques for peer-to-peer networks
Feldman, M., Lai, K., Stoica, I., & Chuang, J. (2004) · Proceedings of the 5th ACM conference on Electronic commerce · doi:10.1145/988772.988788 · Cited by 558
A Robust Reputation System for P2P and Mobile Ad-hoc Networks
Buchegger, S., & Boudec, J. L. (2004) · Cited by 544
The Social Cost of Cheap Pseudonyms
Friedman*, E. J., & Resnick, P. (2001) · Journal of Economics & Management Strategy · doi:10.1111/j.1430-9134.2001.00173.x · Cited by 536
A Social Mechanism of Reputation Management in Electronic Communities
Yu, B., & Singh, M. P. (2000) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-45012-2_15 · Cited by 464
A content-driven reputation system for the wikipedia
Adler, B. T., & de Alfaro, L. (2007) · Proceedings of the 16th international conference on World Wide Web · doi:10.1145/1242572.1242608 · Cited by 440
Taxonomy of trust: Categorizing P2P reputation systems
Marti, S., & Garcia-Molina, H. (2006) · Computer Networks · doi:10.1016/j.comnet.2005.07.011 · Cited by 433
Trusted P2P Transactions with Fuzzy Reputation Aggregation
Song, S., Hwang, K., Zhou, R., & Kwok, Y.-K. (2005) · IEEE Internet Computing · doi:10.1109/mic.2005.136 · Cited by 408
Do incentives build robustness in bit torrent
Piatek, M., Isdal, T., Anderson, T. E., Krishnamurthy, A., & Venkataramani, A. (2007) · Cited by 377
The Social Cost of Cheap Pseudonyms
Friedman, E. J., & Resnick, P. (2001) · Journal of Economics & Management Strategy · doi:10.1162/105864001300122476 · Cited by 377
TrustGuard: countering vulnerabilities in reputation management for decentralized overlay networks
Srivatsa, M., Xiong, L., & Liu, L. (2005) · Proceedings of the 14th international conference on World Wide Web - WWW '05 · doi:10.1145/1060745.1060808 · Cited by 309
A Reputation-Based Trust Model for Peer-to-Peer eCommerce Communities
Xiong, L., & Liu, L. (2003) · Cited by 301
TrustMe: anonymous management of trust relationships in decentralized P2P systems
Singh, A., & Liu, L. (2003) · Proceedings Third International Conference on Peer-to-Peer Computing (P2P2003) · doi:10.1109/ptp.2003.1231514 · Cited by 287
Sybilproof reputation mechanisms
Cheng, A., & Friedman, E. (2005) · Proceeding of the 2005 ACM SIGCOMM workshop on Economics of peer-to-peer systems - P2PECON '05 · doi:10.1145/1080192.1080202 · Cited by 269
SybilGuard: defending against sybil attacks via social networks
Yu, H., Kaminsky, M., Gibbons, P. B., & Flaxman, A. (2006) · Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications · doi:10.1145/1159913.1159945 · Cited by 260
Cooperative peer groups in NICE
Lee, S., Sherwood, R., & Bhattacharjee, B. (2003) · IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428) · doi:10.1109/infcom.2003.1208963 · Cited by 257
Experience with an object reputation system for peer-to-peer filesharing
Walsh, K. S., & Sirer, E. G. (2006) · Networked Systems Design and Implementation · Cited by 255
A reputation-based trust model for peer-to-peer e-commerce communities
Xiong, L., & Liu, L. (2003) · IEEE International Conference on E-Commerce, 2003. CEC 2003. · doi:10.1109/coec.2003.1210262 · Cited by 217
Limited reputation sharing in P2P systems
Marti, S., & Garcia-Molina, H. (2004) · Proceedings of the 5th ACM conference on Electronic commerce · doi:10.1145/988772.988787 · Cited by 214
Cooperative peer groups in NICE
Sherwood, R., Lee, S., & Bhattacharjee, B. (2006) · Computer Networks · doi:10.1016/j.comnet.2005.07.012 · Cited by 213
Attack-Resistant Trust Metrics
Levien, R. (2009) · Human–Computer Interaction Series · doi:10.1007/978-1-84800-356-9_5 · Cited by 206
Managing and sharing servents' reputations in P2P systems
Damiani, E., De Capitani di Vimercati, S., Paraboschi, S., & Samarati, P. (2003) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2003.1209003 · Cited by 192
An Empirical Study of Collusion Behavior in the Maze P2P File-Sharing System
Lian, Q., Zhang, Z., Yang, M., Zhao, B. Y., Dai, Y., & Li, X. (2007) · Proceedings of the ... International Conference on Distributed Computing Systems/Proceedings of the International Conference on Distributed Computing Systems · doi:10.1109/icdcs.2007.84 · Cited by 168
A reputation-based trust model for peer-to-peer ecommerce communities [Extended Abstract]
Xiong, L., & Liu, L. (2003) · Proceedings of the 4th ACM conference on Electronic commerce · doi:10.1145/779928.779972 · Cited by 165
Ranking systems: the PageRank axioms
Altman, A., & Tennenholtz, M. (2005) · ACM Conference on Electronic Commerce (EC) · doi:10.1145/1064009.1064010 · Cited by 158
Proceedings 15th International Parallel and Distributed Processing Symposium. IPDPS 2001
(2001) · Proceedings - IEEE International Parallel and Distributed Processing Symposium · doi:10.1109/ipdps.2001.924926 · Cited by 156
Fuzzy techniques for trust and reputation management in anonymous peer‐to‐peer systems
Aringhieri, R., Damiani, E., di Vimercati, S. D. C., Paraboschi, S., & Samarati, P. (2006) · Journal of the American Society for Information Science and Technology · doi:10.1002/asi.20307 · Cited by 139
A Survey of Trust Management and Resource Discovery Technologies in Peer-to-Peer Applications
Suryanarayana, G., & Taylor, R. N. (2004) · Cited by 99
Axiomatic Foundations for Ranking Systems
Altman, A., & Tennenholtz, M. (2008) · Journal of Artificial Intelligence Research · doi:10.1613/jair.2306 · Cited by 92
On the establishment of distinct identities in overlay networks
Bazzi, R. A., & Konjevod, G. (2005) · ACM Symposium on Principles of Distributed Computing (PODC) · doi:10.1145/1073814.1073873 · Cited by 75
Self-selection, slipping, salvaging, slacking, and stoning: the impacts of negative feedback at eBay
Khopkar, T., Li, X., & Resnick, P. (2005) · ACM Conference on Electronic Commerce (EC) · doi:10.1145/1064009.1064033 · Cited by 74
Manipulability of PageRank under Sybil Strategies
Cheng, A., & Friedman, E. (2006) · Cited by 66
Scrivener: Providing Incentives in Cooperative Content Distribution Systems
Nandi, A., Ngan, T., Singh, A. K., Druschel, P., & Wallach, D. S. (2005) · Lecture notes in computer science · doi:10.1007/11587552_14 · Cited by 63
Enhancing peer-to-peer systems through redundancy
Flocchini, P., Nayak, A. R., & Xie, M. (2007) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2007.070103 · Cited by 35
SuperTrust: a secure and efficient framework for handling trust in super-peer networks
Dimitriou, T. D., Karame, G., & Christou, I. T. (2007) · ACM Symposium on Principles of Distributed Computing (PODC) · doi:10.1145/1281100.1281180 · Cited by 22
Survey of Six Myths and Oversights about Distributed Hash Tables' Security
Dahan, S., & Sato, M. (2007) · IEEE International Conference on Distributed Computing Systems Workshops (ICDCSW) · doi:10.1109/icdcsw.2007.77 · Cited by 6
Cited by
Co-Creation: Toward a Taxonomy and an Integrated Research Perspective
Zwass, V. (2010) · International Journal of Electronic Commerce · doi:10.2753/jec1086-4415150101 · Cited by 776
A survey of trust in social networks
Sherchan, W., Nepal, S., & Paris, C. (2013) · ACM Computing Surveys · doi:10.1145/2501654.2501661 · Cited by 671
Ureña, R., Kou, G., Dong, Y., Chiclana, F., & Herrera-Viedma, E. (2019) · Information Sciences · doi:10.1016/j.ins.2018.11.037 · Cited by 410
Privacy preservation in federated learning: An insightful survey from the GDPR perspective
Truong, N., Sun, K., Wang, S., Guitton, F., & Guo, Y. (2021) · Computers & Security · doi:10.1016/j.cose.2021.102402 · Cited by 399
Trust mechanisms in wireless sensor networks: Attack analysis and countermeasures
Yu, Y., Li, K., Zhou, W., & Li, P. (2012) · Journal of Network and Computer Applications · doi:10.1016/j.jnca.2011.03.005 · Cited by 353
Metadata
- Authors
- Hoffman, K., Zage, D., & Nita-Rotaru, C.
- Venue
- ACM Computing Surveys
- Published
- 2009-12
- Volume
- 42
- Issue
- 1
- Pages
- 1-31
- ISSN
- 0360-0300 (ISSN-L)
- 1557-7341
- OpenAlex
- W2087092764
- Cited by
- 777
- References
- 66
- FWCI
- 209.49
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.