The DOI matches its Crossref record; 12 of the 12 references it cites were found in a registry or an index.
Byzantine modification detection in multicast networks using randomized network coding
Open accessAbstract
Distributed randomized network coding, a robust approach to multicasting in distributed network settings, can be extended to provide Byzantine modification detection without the use of cryptographic functions is presented in this paper.
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.
Integrity signals
Registry
Cites
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.
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
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
The Byzantine generals problem
Lamport, L., Shostak, R., & Pease, M. (1982) · ACM Transactions on Programming Languages and Systems · doi:10.1145/357172.357176 · Cited by 6,023
Practical Byzantine fault tolerance
Castro, M., & Liskov, B. H. (1999) · Operating Systems Design and Implementation · doi:10.5555/296806.296824 · Cited by 3,205
An algebraic approach to network coding
Koetter, R., & Medard, M. (2003) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2003.818197 · Cited by 2,356
Self-citationSecure Routing in Mobile Ad hoc Networks
(2022) · doi:10.22271/ed.book.2027 · Cited by 1,227
On coding for reliable communication over packet networks
Lun, D. S., Médard, M., Koetter, R., & Effros, M. (2008) · Physical Communication · doi:10.1016/j.phycom.2008.01.006 · Cited by 559
Self-citationCai, N., & Yeung, R. W. (2003) · Proceedings IEEE International Symposium on Information Theory, · doi:10.1109/isit.2002.1023595 · Cited by 444
Perfectly secure message transmission
Dolev, D., Dwork, C., Waarts, O., & Yung, M. (1993) · Journal of the ACM · doi:10.1145/138027.138036 · Cited by 412
Capacity of wireless erasure networks
Dana, A. F., Gowaikar, R., Palanki, R., Hassibi, B., & Effros, M. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2005.864424 · Cited by 389
Self-citationPractical Byzantine fault tolerance
de Castro, O. T., & Miguel, M. D. (2000) · Cited by 372
The SecureRing protocols for securing group communication
Kihlstrom, K. P., Moser, L. E., & Melliar-Smith, P. M. (2002) · Proceedings of the Thirty-First Hawaii International Conference on System Sciences · doi:10.1109/hicss.1998.656294 · Cited by 171
Fully Polynomial Byzantine Agreement for n > 3 t Processors in t + 1 Rounds
Garay, J. A., & Moses, Y. (1998) · SIAM Journal on Computing · doi:10.1137/s0097539794265232 · Cited by 138
Cited by
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
Signing a Linear Subspace: Signature Schemes for Network Coding
Boneh, D., Freeman, D., Katz, J., & Waters, B. (2009) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-00468-1_5 · Cited by 351
Metadata
- Authors
- Ho, T., Leong, B., Koetter, R., Medard, M., Effros, M., & Karger, D. R.
- Venue
- International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings.
- Publisher
- IEEE
- Published
- 2004-12-23
- Pages
- 143-143
- OpenAlex
- W2563871604
- Cited by
- 253
- References
- 12
- FWCI
- 6.51
- Type
- conference paper
- 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
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.