The DOI matches its Crossref record; 19 of the 19 references it cites were found in a registry or an index.
Trusted P2P Transactions with Fuzzy Reputation Aggregation
Open accessAbstract
Internet commerce and online commodity exchanges suffer from distrust among sellers and buyers, who are often strangers to each other. The authors present a new P2P reputation system based on fuzzy logic inferences, which can better handle uncertainty, fuzziness, and incomplete information in peer trust reports. This system aggregates peer reputations with affordable message overhead. By testing the system using eBay transaction data in the public domain, the authors seek to demonstrate the efficacy and robustness of two P2P reputation systems - fuzzytrust and eigentrust - at establishing trust among the peers in P2P applications.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Zadeh, L. A. (1965) · Information and Control · doi:10.1016/s0019-9958(65)90241-x · Cited by 67,855
Zadeh, L. A. (1996) · Cited by 46,844
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
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
Chord: a scalable peer-to-peer lookup protocol for internet applications
Stoica, I., Morris, R., Liben-Nowell, D., Karger, D. R., Kaashoek, M. F., Dabek, F., & Balakrishnan, H. (2003) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2002.808407 · Cited by 3,133
Trust among strangers in internet transactions: Empirical analysis of eBay' s reputation system
Resnick, P., & Zeckhauser, R. (2004) · Advances in Applied Microeconomics · doi:10.1016/s0278-0984(02)11030-3 · Cited by 1,804
PeerTrust: Supporting Reputation-Based Trust for Peer-to-Peer Electronic Communities
Xiong, L., & Liu, L. (2004) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2004.1318566 · Cited by 1,788
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 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/775240.775242 · Cited by 1,365
Cited by
Distributed and cloud computing: from parallel processing to the Internet of things
(2012) · Choice Reviews Online · doi:10.5860/choice.49-5712 · Cited by 314
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
Trust management for service migration in Multi-access Edge Computing environments
Le, V. T., Ioini, N. E., Barzegar, H. R., & Pahl, C. (2022) · Computer Communications · doi:10.1016/j.comcom.2022.07.039 · Cited by 21
A hybrid trust model using reinforcement learning and fuzzy logic
Aref, A., & Tran, T. (2018) · Computational Intelligence · doi:10.1111/coin.12155 · Cited by 16
Metadata
- Authors
- Song, S., Hwang, K., Zhou, R., & Kwok, Y.-K.
- Venue
- IEEE Internet Computing
- Published
- 2005-11
- Volume
- 9
- Issue
- 6
- Pages
- 24-34
- ISSN
- 1089-7801 (ISSN-L)
- OpenAlex
- W2121535370
- Cited by
- 408
- References
- 19
- FWCI
- 98.05
- Type
- journal article
- Language
- en
- Open access
- green
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Trusted P2P Transactions with Fuzzy Reputation Aggregation. https://app.cochat.ai/papers/10.1109/mic.2005.136
- The paper
- Song, S., Hwang, K., Zhou, R., & Kwok, Y.-K. (2005). Trusted P2P Transactions with Fuzzy Reputation Aggregation. IEEE Internet Computing. https://doi.org/10.1109/mic.2005.136
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.
