The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Cooperative Security for Network Coding File Distribution
Abstract
Peer-to-peer content distribution networks can suffer from malicious participants that corrupt content. Current systems verify blocks with traditional cryptographic signatures and hashes. However, these techniques do not apply well to more elegant schemes that use network coding techniques for efficient content distribution. Architectures that use network coding are prone to jamming attacks where the introduction of a few corrupted blocks can quickly result in a large number of bad blocks propagating through the system. Identifying such bogus blocks is difficult and requires the use of homomorphic hashing functions, which are computationally expensive. This paper presents a practical security scheme for network coding that reduces the cost of verifying blocks on-the-fly while efficiently preventing the propagation of malicious blocks. In our scheme, users not only cooperate to distribute the content, but (well-behaved) users also cooperate to protect themselves against malicious users by informing affected nodes when a malicious block is found. We analyze and study such cooperative security scheme and introduce elegant techniques to prevent DoS attacks. We show that the loss in the efficiency caused by the attackers is limited to the effort the attackers put to corrupt the communication, which is a natural lower bound in the damage of the system. We also show experimentally that checking as low as 1-5% of the received blocks is enough to guarantee low corruption rates.
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
Protocols for Public Key Cryptosystems
Merkle, R. C. (1980) · 1980 IEEE Symposium on Security and Privacy · doi:10.1109/sp.1980.10006 · Cited by 1,418
Cited by
Network coding for large scale content distribution
Gkantsidis, C., & Rodriguez, P. R. (2005) · Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies. · doi:10.1109/infcom.2005.1498511 · Cited by 1,051
Self-citationDoS and DDoS in Named Data Networking
Gasti, P., Tsudik, G., Uzun, E., & Zhang, L. (2013) · 2013 22nd International Conference on Computer Communication and Networks (ICCCN) · doi:10.1109/icccn.2013.6614127 · Cited by 315
Network Coding for the Internet and Wireless Networks
Chou, P., & Wu, Y. (2007) · IEEE Signal Processing Magazine · doi:10.1109/msp.2007.904818 · Cited by 253
Metadata
- Authors
- Gkantsidis, C., & Rodriguez Rodriguez, P.
- Venue
- Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications
- Publisher
- IEEE
- Published
- 2006
- Pages
- 1-13
- OpenAlex
- W2162219773
- Cited by
- 308
- References
- 1
- FWCI
- 14.45
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Cooperative Security for Network Coding File Distribution. https://app.cochat.ai/papers/10.1109/infocom.2006.233
- The paper
- Gkantsidis, C., & Rodriguez Rodriguez, P. (2006). Cooperative Security for Network Coding File Distribution. Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications. https://doi.org/10.1109/infocom.2006.233
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.