Secure Determinant Codes: Type-II Security

Michelle Kleckler, Soheil Mohajer

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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 languageEnglish (US)
Title of host publication2020 IEEE International Symposium on Information Theory, ISIT 2020 - Proceedings
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages652-657
Number of pages6
ISBN (Electronic)9781728164328
DOIs
StatePublished - Jun 2020
Event2020 IEEE International Symposium on Information Theory, ISIT 2020 - Los Angeles, United States
Duration: Jul 21 2020Jul 26 2020

Publication series

NameIEEE International Symposium on Information Theory - Proceedings
Volume2020-June
ISSN (Print)2157-8095

Conference

Conference2020 IEEE International Symposium on Information Theory, ISIT 2020
CountryUnited States
CityLos Angeles
Period7/21/207/26/20

Bibliographical note

Funding Information:
This work is supported by the U.S. National Science Foundation under Grant CCF-1617884.

Fingerprint Dive into the research topics of 'Secure Determinant Codes: Type-II Security'. Together they form a unique fingerprint.

Cite this