The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Optimal Locally Repairable and Secure Codes for Distributed Storage Systems
Open accessAbstract
This paper aims to go beyond resilience into the study of security and local-repairability for distributed storage systems (DSSs). Security and local-repairability are both important as features of an efficient storage system, and this paper aims to understand the trade-offs between resilience, security, and local-repairability in these systems. In particular, this paper first investigates security in the presence of colluding eavesdroppers, where eavesdroppers are assumed to work together in decoding the stored information. Second, this paper focuses on coding schemes that enable optimal local repairs. It further brings these two concepts together to develop locally repairable coding schemes for DSS that are secure against eavesdroppers. The main results of this paper include: 1) an improved bound on the secrecy capacity for minimum storage regenerating codes; 2) secure coding schemes that achieve the bound for some special cases; 3) a new bound on minimum distance for locally repairable codes; 4) code construction for locally repairable codes that attain the minimum distance bound; and 5) repair-bandwidth-efficient locally repairable codes with and without security constraints.
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 · cited 2×
“We subsequently combine the classical secret sharing scheme due to [15] with an existing class of exact repairable MSR codes to securely store data in the presence of an(l1, l2) eavesdropper.”
MethodCommunication Theory of Secrecy Systems
Shannon, C. E. (1949) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1949.tb00928.x · Cited by 9,440 · cited 1×
“…in Coding Theory, Ascona, Switzerland, October 2012; at IEEE Information Theory and Applications Workshop, San Diego, CA, February 2013; and at IEEE International Symposium on Information Theory, Istanbul, Turkey, July 2013. distributed; therefore, local-repairability in storage proves very useful.”
BackgroundDean, J., & Barroso, L. A. (2013) · Communications of the ACM · doi:10.1145/2408776.2408794 · Cited by 1,852 · cited 2×
“Similar ideas to reduce response time for file reconstruction with MDS codes have been proposed in [41], [42].”
Background
Cited by
Speeding Up Distributed Machine Learning Using Codes
Lee, K., Lam, M., Pedarsani, R., Papailiopoulos, D., & Ramchandran, K. (2018) · IEEE Transactions on Information Theory · doi:10.1109/tit.2017.2736066 · Cited by 829
Secure Data Storage and Recovery in Industrial Blockchain Network Environments
Liang, W., Fan, Y., Li, K.-C., Zhang, D., & Gaudiot, J.-L. (2020) · IEEE Transactions on Industrial Informatics · doi:10.1109/tii.2020.2966069 · Cited by 279
Metadata
- Authors
- Rawat, A. S., Koyluoglu, O. O., Silberstein, N., & Vishwanath, S.
- Venue
- IEEE Transactions on Information Theory
- Published
- 2014-01
- Volume
- 60
- Issue
- 1
- Pages
- 212-236
- ISSN
- 0018-9448 (ISSN-L)
- 1557-9654
- OpenAlex
- W2014149071
- Cited by
- 201
- References
- 3
- FWCI
- 30.43
- Type
- journal article
- 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.