|Secure Determinant Codes: Type-II Security
|Michelle Kleckler, University of Minnesota, United States; Soheil Mohajer, University of Minnesota, Twin, United States
|M.4: Codes for Distributed Storage IV
|Coding for Storage and Memories
|Click here to download the manuscript
|Click here to watch in the Virtual Symposium
|The secure exact-repair regenerating codes are studied, for distributed storage systems with parameters $(n,k=d,d,\ell)$. 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) $\ell$ 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.