Abstract

As a kind of special MDS erasure coding, regenerating codes are firstly used to solve the fault-tolerant problem in distributed storage systems. This paper constructs a new kind of secret sharing algorithm based on regenerating codes. The main process is that the original secret data is firstly stripped and coded with MDS erasure coding algorithm, then the vector components are periodically distributed to secret sharers in a certain order. The secret data can be rebuilt by decoding algorithm of regenerating codes if there are enough shares of the secret. Theoretical analysis shows that the algorithm is a safe threshold scheme. Because the operations are mainly linear on small finite field and its computation cost is low, so it is easy to realize.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.