Abstract: Erasure codes and regenerating codes can guarantee data reliability, but fail to provide data confidential when some nodes are observed by eavesdropper. Thus, two regenerating code schemes satisfying the security property against the eavesdropper are proposed in this paper. Combining the All-or-Nothing transform and exact repair regenerating codes, the proposed schemes not only ensure that an intruder eavesdropping limited number of nodes are unable to obtain any meaningful information about the original data symbols, but also provide data reliability with low repair bandwidth. Furthermore, a general construction method is presented, and the security is proved, and the performance of the proposed scheme is evaluated by a serial of experiments. The result shows that the proposed schemes achieve faster encode/decode procedures and better secrecy capacity compared with other secure regenerating coding schemes or threshold storage schemes.