TY - GEN
T1 - Secure Determinant Codes
T2 - 2019 IEEE International Symposium on Information Theory, ISIT 2019
AU - Kleckler, Michelle
AU - Mohajer, Soheil
PY - 2019/7
Y1 - 2019/7
N2 - 1 We present a construction for exact-repair regenerating codes with an information-theoretic secrecy guarantee against an eavesdropper with access to the content of (up to) ℓ nodes. The proposed construction works for the entire range of per-node storage and repair bandwidth for any distributed storage system with parameters (n, k = d, d, ℓ), aiming to maximize the size of the file that can be securely stored in the system. We provide an upper bound for the optimum trade-off for secure exact-repair regenerating codes.
AB - 1 We present a construction for exact-repair regenerating codes with an information-theoretic secrecy guarantee against an eavesdropper with access to the content of (up to) ℓ nodes. The proposed construction works for the entire range of per-node storage and repair bandwidth for any distributed storage system with parameters (n, k = d, d, ℓ), aiming to maximize the size of the file that can be securely stored in the system. We provide an upper bound for the optimum trade-off for secure exact-repair regenerating codes.
UR - http://www.scopus.com/inward/record.url?scp=85073151399&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85073151399&partnerID=8YFLogxK
U2 - 10.1109/ISIT.2019.8849391
DO - 10.1109/ISIT.2019.8849391
M3 - Conference contribution
AN - SCOPUS:85073151399
T3 - IEEE International Symposium on Information Theory - Proceedings
SP - 211
EP - 215
BT - 2019 IEEE International Symposium on Information Theory, ISIT 2019 - Proceedings
PB - Institute of Electrical and Electronics Engineers Inc.
Y2 - 7 July 2019 through 12 July 2019
ER -