The DOI matches its Crossref record; 18 of the 18 references it cites were found in a registry or an index.
TrustGuard: countering vulnerabilities in reputation management for decentralized overlay networks
Abstract
Reputation systems have been popular in estimating the trustworthiness and predicting the future behavior of nodes in a large-scale distributed system where nodes may transact with one another without prior knowledge or experience. One of the fundamental challenges in distributed reputation management is to understand vulnerabilities and develop mechanisms that can minimize the potential damages to a system by malicious nodes. In this paper, we identify three vulnerabilities that are detrimental to decentralized reputation management and propose TrustGuard - a safeguard framework for providing a highly dependable and yet efficient reputation system. First, we provide a dependable trust model and a set of formal methods to handle strategic malicious nodes that continuously change their behavior to gain unfair advantages in the system. Second, a transaction based reputation system must cope with the vulnerability that malicious nodes may misuse the system by flooding feedbacks with fake transactions. Third, but not least, we identify the importance of filtering out dishonest feedbacks when computing reputation-based trust of a node, including the feedbacks filed by malicious nodes through collusion. Our experiments show that, comparing with existing reputation systems, our framework is highly dependable and effective in countering malicious nodes regarding strategic oscillating behavior, flooding malevolent feedbacks with fake transactions, and dishonest feedbacks.
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
(1999) · Cited by 12,854
Douceur, J. R. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-45748-8_24 · Cited by 4,419
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
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
Trust Management for the Semantic Web
Richardson, M., Agrawal, R., & Domingos, P. (2003) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-39718-2_23 · Cited by 982
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
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
Fishman, G. S. (2001) · Springer eBooks · doi:10.1007/978-1-4757-3552-9 · Cited by 684
Shilling recommender systems for fun and profit
Lam, S. K., & Riedl, J. (2004) · Proceedings of the 13th international conference on World Wide Web · doi:10.1145/988672.988726 · Cited by 635
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
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
Choosing reputable servents in a P2P network
Cornelli, F., Damiani, E., di Vimercati, S. D. C., Paraboschi, S., & Samarati, P. (2002) · Proceedings of the 11th international conference on World Wide Web · doi:10.1145/511446.511496 · Cited by 349
A Reputation-Based Trust Model for Peer-to-Peer eCommerce Communities
Xiong, L., & Liu, L. (2003) · Cited by 301
Self-citationA 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
Self-citationVulnerabilities and Security Threats in Structured Overlay Networks: A Quantitative Analysis
Srivatsa, M., & Liu, L. (2005) · Annual Computer Security Applications Conference · doi:10.1109/csac.2004.50 · Cited by 119
Self-citationSanctioning Reputation Mechanisms in Online Trading Environments with Moral Hazard
Dellarocas, C. N. (2003) · doi:10.2139/ssrn.393043 · Cited by 50
Cited by
A survey of attack and defense techniques for reputation systems
Hoffman, K., Zage, D., & Nita-Rotaru, C. (2009) · ACM Computing Surveys · doi:10.1145/1592451.1592452 · Cited by 777
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
Reputation systems: A survey and taxonomy
Hendrikx, F., Bubendorfer, K., & Chard, R. (2015) · Journal of Parallel and Distributed Computing · doi:10.1016/j.jpdc.2014.08.004 · Cited by 219
Metadata
- Authors
- Srivatsa, M., Xiong, L., & Liu, L.
- Venue
- Proceedings of the 14th international conference on World Wide Web - WWW '05
- Publisher
- ACM Press
- Published
- 2005
- Pages
- 422
- OpenAlex
- W2129124450
- Cited by
- 309
- References
- 18
- Type
- conference abstract
- 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.