The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Secure network coding
Abstract
Recent work on network coding renders a new view on multicasting in a network. In the paradigm of network coding, the nodes in a network are allowed to encode the information received from the input links. The usual function of switching at a node is a special case of network coding. The advantage of network coding is that the full capacity of the network can be utilized. In this paper, we propose a new model which incorporates network coding and information security. Specifically, a collection of subsets of links is given, and a wiretapper is allowed to access any one (but not more than one) of these subsets without being able to obtain any information about the message transmitted. Our model includes secret sharing as a special case. We present a construction of secure linear network codes provided a certain graph-theoretic sufficient condition is satisfied.
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
Shamir, A. (1979) · Communications of the ACM · doi:10.1145/359168.359176 · Cited by 13,756
Ahlswede, R., Cai, N., Li, S.-Y. R., & Yeung, R. W. (2000) · IEEE Transactions on Information Theory · doi:10.1109/18.850663 · Cited by 7,814
Self-citationLi, S.-Y. R., Yeung, R. W., & Cai, N. (2003) · IEEE Transactions on Information Theory · doi:10.1109/tit.2002.807285 · Cited by 3,378
Self-citation
Cited by
Trading structure for randomness in wireless opportunistic routing
Chachulski, S., Jennings, M., Katti, S., & Katabi, D. (2007) · Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications · doi:10.1145/1282380.1282400 · Cited by 1,082
Information Theoretic Security
Liang, Y., Poor, H. V., & Shamai (Shitz), S. (2007) · now publishers, Inc. eBooks · doi:10.1561/9781601982414 · Cited by 686
Yeung, R. W., Li, S.-Y. R., Cai, N., & Zhang, Z. (2006) · Foundations and Trends® in Communications and Information Theory · doi:10.1561/0100000007 · Cited by 381
Self-citationPrivacyProtector: Privacy-Protected Patient Data Collection in IoT-Based Healthcare Systems
Luo, E., Bhuiyan, M. Z. A., Wang, G., Rahman, M. A., Wu, J., & Atiquzzaman, M. (2018) · IEEE Communications Magazine · doi:10.1109/mcom.2018.1700364 · Cited by 266
Metadata
- Authors
- Cai, N., & Yeung, R. W.
- Venue
- Proceedings IEEE International Symposium on Information Theory,
- Publisher
- IEEE
- Published
- 2003-06-25
- Pages
- 323-323
- OpenAlex
- W2136395129
- Cited by
- 444
- References
- 3
- FWCI
- 4.91
- 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: Secure network coding. https://app.cochat.ai/papers/10.1109/isit.2002.1023595
- The paper
- Cai, N., & Yeung, R. W. (2003). Secure network coding. Proceedings IEEE International Symposium on Information Theory,. https://doi.org/10.1109/isit.2002.1023595
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.
