Secure Determinant Codes: Type-II Security

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.