The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
Efficient dispersal of information for security, load balancing, and fault tolerance
Open accessAbstract
An Information Dispersal Algorithm (IDA) is developed that breaks a file F of length L = ↿ F ↾ into n pieces F i , l ≤ i ≤ n , each of length ↿ F i ↾ = L / m , so that every m pieces suffice for reconstructing F . Dispersal and reconstruction are computationally efficient. The sum of the lengths ↿ F i ↾ is ( n / m ) · L . Since n / m can be chosen to be close to l, the IDA is space efficient. IDA has numerous applications to secure and reliable storage of information in computer networks and even on single disks, to fault-tolerant and efficient transmission of information in networks, and to communications between processors in parallel computers. For the latter problem provably time-efficient and highly fault-tolerant routing on the n -cube is achieved, using just constant size buffers.
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
Shamir, A. (1979) · Communications of the ACM · doi:10.1145/359168.359176 · Cited by 13,756
Algebraic Coding Theory: Revised Edition
Berlekamp, E. R. (2015) · WORLD SCIENTIFIC eBooks · doi:10.1142/9407 · Cited by 2,474
Hillis, W. D. (1987) · Scientific American · doi:10.1038/scientificamerican0687-108 · Cited by 1,635
An introduction to linear algebra
Mirsky, L. (1955) · CERN Document Server (European Organization for Nuclear Research) · Cited by 420
Cited by
MapReduce: simplified data processing on large clusters
Dean, J., & Ghemawat, S. (2008) · Communications of the ACM · doi:10.1145/1327452.1327492 · Cited by 18,476
Basic concepts and taxonomy of dependable and secure computing
Avizienis, A., Laprie, J.-C., Randell, B., & Landwehr, C. (2004) · IEEE Transactions on Dependable and Secure Computing · doi:10.1109/tdsc.2004.2 · Cited by 5,223
MapReduce: Simplified Data Processing on Large Cluster
Senior Software Developer, A. U., & Dayalan, M. (2018) · International Journal of Research and Engineering · doi:10.21276/ijre.2018.5.5.4 · Cited by 2,948
Luby, M. (2003) · The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings. · doi:10.1109/sfcs.2002.1181950 · Cited by 2,757
Karger, D., Lehman, E., Leighton, T., Panigrahy, R., Levine, M., & Lewin, D. (1997) · Proceedings of the twenty-ninth annual ACM symposium on Theory of computing - STOC '97 · doi:10.1145/258533.258660 · Cited by 1,981
Pors: proofs of retrievability for large files
Juels, A., & Kaliski, B. S. (2007) · Proceedings of the 14th ACM conference on Computer and communications security · doi:10.1145/1315245.1315317 · Cited by 1,894
Wide-area cooperative storage with CFS
Dabek, F., Kaashoek, M. F., Karger, D., Morris, R., & Stoica, I. (2001) · Proceedings of the eighteenth ACM symposium on Operating systems principles · doi:10.1145/502034.502054 · Cited by 1,428
A survey of peer-to-peer content distribution technologies
Androutsellis-Theotokis, S., & Spinellis, D. (2004) · ACM Computing Surveys · doi:10.1145/1041680.1041681 · Cited by 1,425
Compact Proofs of Retrievability
Shacham, H., & Waters, B. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-89255-7_7 · Cited by 1,395
A digital fountain approach to reliable distribution of bulk data
Byers, J. W., Luby, M., Mitzenmacher, M., & Rege, A. (1998) · Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication · doi:10.1145/285237.285258 · Cited by 1,138
RapidChain: Scaling Blockchain via Full Sharding
Zamani, M., Movahedi, M., & Raykova, M. (2018) · Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security · doi:10.1145/3243734.3243853 · Cited by 1,121
(2002) · Choice Reviews Online · doi:10.5860/choice.39-2844 · Cited by 613
A digital fountain approach to asynchronous reliable multicast
Byers, J. W., Luby, M., & Mitzenmacher, M. (2002) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2002.803996 · Cited by 580
Secure Deduplication with Efficient and Reliable Convergent Key Management
Li, J., Chen, X., Li, M., Li, J., Lee, P. P. C., & Lou, W. (2014) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/tpds.2013.284 · Cited by 549
A First Course in Information Theory
Yeung, R. W. (2002) · Information Technology: Transmission, Processing and Storage · doi:10.1007/978-1-4419-8608-5 · Cited by 533
Priority encoding transmission
Albanese, A., Blomer, J., Edmonds, J., Luby, M., & Sudan, M. (1996) · IEEE Transactions on Information Theory · doi:10.1109/18.556670 · Cited by 532
Malkhi, D., & Reiter, M. (1998) · Distributed Computing · doi:10.1007/s004460050050 · Cited by 530
A tutorial on Reed-Solomon coding for fault-tolerance in RAID-like systems
Plank, J. S. (1997) · Software: Practice and Experience · doi:10.1002/(sici)1097-024x(199709)27:9<995::aid-spe111>3.0.co;2-6 · Cited by 525
Compact Proofs of Retrievability
Shacham, H., & Waters, B. (2013) · Journal of Cryptology · doi:10.1007/s00145-012-9129-2 · Cited by 511
A survey of security issues in mobile ad hoc and sensor networks
Djenouri, D., Khelladi, L., & Badache, A. N. (2005) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2005.1593277 · Cited by 492
Krawczyk, H. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-48329-2_12 · Cited by 359
The Free Haven Project: Distributed Anonymous Storage Service
Dingledine, R., Freedman, M. J., & Molnar, D. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44702-4_5 · Cited by 336
DepSky: Dependable and Secure Storage in a Cloud-of-Clouds
Bessani, A., Correia, M., Quaresma, B., André, F., & Sousa, P. (2013) · ACM Transactions on Storage · doi:10.1145/2535929 · Cited by 330
DepSky: dependable and secure storage in a cloud-of-clouds
Bessani, A., Correia, M., Quaresma, B., André, F., & Sousa, P. (2011) · Proceedings of the sixth conference on Computer systems · doi:10.1145/1966445.1966449 · Cited by 320
COCA: A secure distributed online certification authority
Zhou, L., Schneider, F. B., & Van Renesse, R. (2002) · ACM Transactions on Computer Systems · doi:10.1145/571637.571638 · Cited by 278
Detection of Algebraic Manipulation with Applications to Robust Secret Sharing and Fuzzy Extractors
Cramer, R., Dodis, Y., Fehr, S., Padró, C., & Wichs, D. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-78967-3_27 · Cited by 259
STAR : An Efficient Coding Scheme for Correcting Triple Storage Node Failures
Huang, C., & Xu, L. (2008) · IEEE Transactions on Computers · doi:10.1109/tc.2007.70830 · Cited by 257
Decentralized erasure codes for distributed networked storage
Dimakis, A. G., Prabhakaran, V., & Ramchandran, K. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2006.874535 · Cited by 253
Collaborative and secure sharing of healthcare data in multi-clouds
Fabian, B., Ermakova, T., & Junghanns, P. (2015) · Information Systems · doi:10.1016/j.is.2014.05.004 · Cited by 223
Efficient & secure image availability and content protection
Noura, H., Noura, M., Salman, O., Couturier, R., & Chehab, A. (2020) · Multimedia Tools and Applications · doi:10.1007/s11042-020-09057-4 · Cited by 4
Metadata
- Authors
- Rabin, M. O.
- Venue
- Journal of the ACM
- Published
- 1989-04
- Volume
- 36
- Issue
- 2
- Pages
- 335-348
- ISSN
- 0004-5411 (ISSN-L)
- 1557-735X
- OpenAlex
- W2058972589
- Cited by
- 1,365
- References
- 4
- FWCI
- 21.40
- Type
- journal article
- Language
- en
- Open access
- bronze
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.