Abstract
The secure exact-repair regenerating codes are studied, for distributed storage systems with parameters (n,k = d,d,ℓ). The secrecy constraint guarantees that the message remains secure against an eavesdropper who can observe the incoming repair data from all possible nodes to a fixed but unknown subset of (up to) ℓ compromised nodes (type II secrecy). A class of secure determinant codes are introduced for all system parameters, and an achievable secrecy trade-off between the per-node storage capacity and repair bandwidth is characterized.
| Original language | English (US) |
|---|---|
| Title of host publication | 2020 IEEE International Symposium on Information Theory, ISIT 2020 - Proceedings |
| Publisher | Institute of Electrical and Electronics Engineers Inc. |
| Pages | 652-657 |
| Number of pages | 6 |
| ISBN (Electronic) | 9781728164328 |
| DOIs | |
| State | Published - Jun 2020 |
| Event | 2020 IEEE International Symposium on Information Theory, ISIT 2020 - Los Angeles, United States Duration: Jul 21 2020 → Jul 26 2020 |
Publication series
| Name | IEEE International Symposium on Information Theory - Proceedings |
|---|---|
| Volume | 2020-June |
| ISSN (Print) | 2157-8095 |
Conference
| Conference | 2020 IEEE International Symposium on Information Theory, ISIT 2020 |
|---|---|
| Country/Territory | United States |
| City | Los Angeles |
| Period | 7/21/20 → 7/26/20 |
Bibliographical note
Funding Information:This work is supported by the U.S. National Science Foundation under Grant CCF-1617884.
Publisher Copyright:
© 2020 IEEE.