Secure Storage using Maximally Recoverable Locally Repairable Codes
Fuente:
arXiv
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866929339085357056 |
|---|---|
| author | Janz, Tim Liu, Hedongliang Bitar, Rawad Kschischang, Frank R. |
| author_facet | Janz, Tim Liu, Hedongliang Bitar, Rawad Kschischang, Frank R. |
| contents | This paper considers data secrecy in distributed storage systems (DSSs) using maximally recoverable locally repairable codes (MR-LRCs). Conventional MR-LRCs are in general not secure against eavesdroppers who can observe the transmitted data during a global repair operation. This work enables nonzero secrecy dimension of DSSs encoded by MR-LRCs through a new repair framework. The key idea is to associate each local group with a central processing unit (CPU), which aggregates and transmits the contribution from the intact nodes of their group to the CPU of a group needing a global repair. The aggregation is enabled by so-called local polynomials that can be generated independently in each group. Two different schemes -- direct repair and forwarded repair -- are considered, and their secrecy dimension using MR-LRCs is derived. Positive secrecy dimension is enabled for several parameter regimes. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2405_06098 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Secure Storage using Maximally Recoverable Locally Repairable Codes Janz, Tim Liu, Hedongliang Bitar, Rawad Kschischang, Frank R. Information Theory This paper considers data secrecy in distributed storage systems (DSSs) using maximally recoverable locally repairable codes (MR-LRCs). Conventional MR-LRCs are in general not secure against eavesdroppers who can observe the transmitted data during a global repair operation. This work enables nonzero secrecy dimension of DSSs encoded by MR-LRCs through a new repair framework. The key idea is to associate each local group with a central processing unit (CPU), which aggregates and transmits the contribution from the intact nodes of their group to the CPU of a group needing a global repair. The aggregation is enabled by so-called local polynomials that can be generated independently in each group. Two different schemes -- direct repair and forwarded repair -- are considered, and their secrecy dimension using MR-LRCs is derived. Positive secrecy dimension is enabled for several parameter regimes. |
| title | Secure Storage using Maximally Recoverable Locally Repairable Codes |
| topic | Information Theory |
| url | https://arxiv.org/abs/2405.06098 |