An efficient implementation of the Shamir secret sharing scheme
This work addresses computational bottlenecks in cryptographic secret sharing, offering a more efficient solution for applications requiring secure data distribution, though it appears incremental as it modifies an existing scheme.
The paper tackled the inefficiency in implementing the Shamir secret sharing scheme by proposing a simpler and faster encoding method that drops the MDS condition and uses XOR-based array codes instead of Reed-Solomon codes.
The Shamir secret sharing scheme requires a Maximum Distance Separable (MDS) code, and in its most common implementation, a Reed-Solomon (RS) code is used. In this paper, we observe that the encoding procedure can be made simpler and faster by dropping the MDS condition and specifying the possible symbols that can be shared. In particular, the process can be made even faster by using array codes based on XOR operations instead of RS codes.