The DOI matches its Crossref record; 39 of the 39 references it cites were found in a registry or an index.
Taxonomy of trust: Categorizing P2P reputation systems
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
(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
Douceur, J. R. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-45748-8_24 · Cited by 4,419
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
Self-citationChord: 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
Incentives Build Robustness in Bit-Torrent
Cohen, B. (2003) · Cited by 2,677
OceanStore: an architecture for global-scale persistent storage
Kubiatowicz, J., Bindel, D., Chen, Y., Czerwinski, S., Eaton, P., Geels, D., Gummadi, R., Rhea, S., Weatherspoon, H., Weimer, W., et al. (2000) · ACM SIGPLAN Notices · doi:10.1145/356989.357007 · Cited by 2,002
Crowds: anonymity for Web transactions
Reiter, M. K., & Rubin, A. D. (1998) · ACM Transactions on Information and System Security · doi:10.1145/290163.290168 · Cited by 1,770
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
OceanStore: an architecture for global-scale persistent storage
Kubiatowicz, J., Bindel, D., Chen, Y., Czerwinski, S., Eaton, P., Geels, D., Gummadi, R., Rhea, S., Weatherspoon, H., Weimer, W., et al. (2000) · Proceedings of the ninth international conference on Architectural support for programming languages and operating systems · doi:10.1145/378993.379239 · Cited by 869
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
Tarzan: a peer-to-peer anonymizing network layer
Freedman, M. J., & Morris, R. (2002) · Proceedings of the 9th ACM conference on Computer and communications security · doi:10.1145/586110.586137 · Cited by 663
Anonymous connections and onion routing
Syverson, P. F., Goldschlag, D. M., & Reed, M. G. (2002) · Proceedings. 1997 IEEE Symposium on Security and Privacy (Cat. No.97CB36097) · doi:10.1109/secpri.1997.601314 · Cited by 629
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
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
The Social Cost of Cheap Pseudonyms
Friedman, E. J., & Resnick, P. (2001) · Journal of Economics & Management Strategy · doi:10.1162/105864001300122476 · Cited by 377
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
Secure routing for structured peer-to-peer overlay networks
Castro, M., Druschel, P., Ganesh, A., Rowstron, A., & Wallach, D. S. (2002) · Proceedings of the 5th symposium on Operating systems design and implementation - OSDI '02 · doi:10.1145/1060289.1060317 · Cited by 328
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
Two Can Keep a Secret: A Distributed Architecture for Secure Database Services
Aggarwal, G., Bawa, M., Ganesan, P., García-Molina, H., Kenthapadi, K., Motwani, R., Srivastava, U., Thomas, D., & Xu, Y. (2005) · Cited by 262
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
PPay: micropayments for peer-to-peer systems
Yang, B., & Garcia-Molina, H. (2003) · Proceedings of the 10th ACM conference on Computer and communications security · doi:10.1145/948109.948150 · Cited by 214
Self-citationLimited 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
Self-citationCooperative peer groups in NICE
Sherwood, R., Lee, S., & Bhattacharjee, B. (2006) · Computer Networks · doi:10.1016/j.comnet.2005.07.012 · Cited by 213
Free-riding and whitewashing in peer-to-peer systems
Feldman, M., Papadimitriou, C., Chuang, J., & Stoica, I. (2004) · Proceedings of the ACM SIGCOMM workshop on Practice and theory of incentives in networked systems - PINS '04 · doi:10.1145/1016527.1016539 · Cited by 190
Trusting Information Sources One Citizen at a Time
Gil, Y., & Ratnakar, V. (2002) · Lecture notes in computer science · doi:10.1007/3-540-48005-6_14 · Cited by 145
SPROUT: P2P Routing with Social Networks
Marti, S., Ganesan, P., & García-Molina, H. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-30192-9_42 · Cited by 119
Self-citationDesigning incentives for peer-to-peer routing
Blanc, A., Liu, Y.-K., & Vahdal, A. (2005) · IEEE Conference on Computer Communications (INFOCOM) · doi:10.1109/infcom.2005.1497907 · Cited by 101
Preserving peer replicas by rate-limited sampled voting
Maniatis, P., Rosenthal, D. S. H., Roussopoulos, M., Baker, M. G., Giuli, T. J., & Muliadi, Y. (2003) · ACM SIGOPS Operating Systems Review · doi:10.1145/1165389.945451 · Cited by 98
Enhancing reputation mechanisms via online social networks
Hogg, T., & Adamic, L. A. (2004) · ACM Conference on Electronic Commerce (EC) · doi:10.1145/988772.988811 · Cited by 97
Identity crisis: anonymity vs reputation in P2P systems
Marti, S., & García-Molina, H. (2004) · International Conference on Peer-to-Peer Computing · doi:10.1109/ptp.2003.1231513 · Cited by 88
Self-citationQuery-flood DoS attacks in gnutella
Daswani, N., & García-Molina, H. (2002) · ACM SIGSAC Conference on Computer and Communications Security (CCS) · doi:10.1145/586110.586136 · Cited by 84
Escrow services and incentives in peer-to-peer networks
Horne, B. G., Benny Pinkas, B., & Sander, T. (2001) · ACM Conference on Electronic Commerce (EC) · doi:10.1145/501158.501168 · Cited by 58
Aggarwal, G., Bawa, M., Ganesan, P., García-Molina, H., Kenthapadi, K., Mishra, N., Motwani, R., Srivastava, U., Thomas, D., Widom, J., et al. (2004) · Elsevier eBooks · doi:10.1016/b978-012088469-8.50063-2 · Cited by 52
Preserving peer replicas by rate-limited sampled voting
Maniatis, P., Rosenthal, D. S. H., Roussopoulos, M., Baker, M. G., Giuli, T. J., & Muliadi, Y. (2003) · ACM SIGOPS Symposium on Operating Systems Principles (SOSP) · doi:10.1145/945445.945451 · Cited by 51
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
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
Social Network Analysis and Mining for Business Applications
Bonchi, F., Castillo, C., Gionis, A., & Jaimes, A. (2011) · ACM Transactions on Intelligent Systems and Technology · doi:10.1145/1961189.1961194 · Cited by 359
A Social Network-Based Recommender System (SNRS)
He, J., & Chu, W. W. (2010) · Annals of Information Systems · doi:10.1007/978-1-4419-6287-4_4 · Cited by 264
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
- Marti, S., & Garcia-Molina, H.
- Venue
- Computer Networks
- Publisher
- Elsevier BV
- Published
- 2006-03
- Volume
- 50
- Issue
- 4
- Pages
- 472-484
- ISSN
- 1389-1286 (ISSN-L)
- OpenAlex
- W2118016433
- Cited by
- 433
- References
- 39
- FWCI
- 85.94
- 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.