CoChat
Cited by 224

The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.

A Survey of Peer-to-Peer Security Issues

Wallach, Dan S. · 2003 · Lecture Notes in Computer Science

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1007/3-540-36532-x_4

Cites

3 of 3 references verified0 citation errors · 0 not checkable

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.

A few free checks a day · papers already verified open instantly · results are public

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

  • Altruistic punishment in humans

    Fehr, E., & Gächter, S. (2002) · Nature · doi:10.1038/415137a · Cited by 5,616 · cited 1×

    “Fehr and Gachter [19] have shown that people are willing to spend money to eject cheaters from an economy, allowing the economy to quickly reach a stable state, free of cheaters.”
    Background
  • The Sybil Attack

    Douceur, J. R. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-45748-8_24 · Cited by 4,419 · cited 3×

    “[31] and Douceur [11] discuss address spoofing attacks.”
    Background
  • Secure communications over insecure channels

    Merkle, R. C. (1978) · Communications of the ACM · doi:10.1145/359460.359473 · Cited by 757 · cited 2×

    “While it may be possible to use some form of cryptographic puzzles [12], these still allow attackers with large computational resources to get a disproportionate number of nodeIds.”
    Background

Cited by

See all 224

Metadata

Authors
Wallach, D. S.
Venue
Lecture Notes in Computer Science
Published
2003
Pages
42-57
ISSN
0302-9743 (ISSN-L)
OpenAlex
W1585819637
Cited by
224
References
3
FWCI
4.62
Type
conference paper
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.