An Efficient Dispersal and Encryption Scheme for Secure Distributed Information Storage

Digital information is a critical resource, creating a need for distributed storage systems that provide sufficient data availability and security in the face of failures and malicious attacks. However, the requirements for achieving high availability and security with distributed storage systems usually conflict with each other. This paper proposes a novel data dispersal/encryption scheme improving both the availability and security of distributed storage system by using some important properties of matrices. It also allows complete recovery of original data even though they are partially damaged. Analysis shows it improves the availability about 15% compared with an efficient existing scheme for both read and write operation, while it allows secure storage simultaneously.

[1]  David Joyner,et al.  Linear Algebra with Applications , 1998 .

[2]  W. Greub.  Linear Algebra , 1981 .

[3]  Alfredo De Santis,et al.  Multiple ramp schemes , 1999, IEEE Trans. Inf. Theory.

[4]  Adi Shamir,et al.  How to share a secret , 1979, CACM.

[5]  Ehud D. Karnin,et al.  On secret sharing systems , 1983, IEEE Trans. Inf. Theory.

[6]  Robert B. Ash,et al.  Information Theory , 2020, The SAGE International Encyclopedia of Mass Media and Society.

[7]  Gregory R. Ganger,et al.  On Correlated Failures in Survivable Storage Systems , 2002 .

[8]  David R. Kincaid,et al.  Numerical analysis: mathematics of scientific computing (2nd ed) , 1996 .

[9]  Catherine A. Meadows,et al.  Security of Ramp Schemes , 1985, CRYPTO.

[10]  Yves Deswarte,et al.  Intrusion tolerance in distributed computing systems , 1991, Proceedings. 1991 IEEE Computer Society Symposium on Research in Security and Privacy.

[11]  Steven J. Leon.  Linear Algebra With Applications , 1980 .

[12]  Pradeep K. Khosla,et al.  Survivable Information Storage Systems , 2000, Computer.

[13]  Yvo Desmedt,et al.  Some Recent Research Aspects of Threshold Cryptography , 1997, ISW.