ESSA： An Efficient and Secure Splitting Algorithm for Distributed Storage Systems

The security of critical data is an important issue for distributed storage system design,especially for long-term storage.ESSA (An Efficient and Secure Splitting Algorithm for Distributed Storage Systems) is presented,which takes advantage of a two level information dispersal scheme to strengthen the security of data.In ESSA,the approach of knight’s tour problem,which is NP-Complete,is introduced to scramble data at the first level,and a split cube is used to split scrambled data at the second level.Thus,it is very difficult for the malicious user to get information because the task of reconstructing the original data needs more computation than they can tolerate.We prove that the security of ESSA is better than encryption algorithm and not inferior to erasure codes and secret sharing.Experimental results show that distributed storage systems exploiting ESSA has greater efficiency than that exploiting keyed encryption,erasure codes and secret sharing.