¹ 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.