Skip to Main Content
A method of rapid secret sharing scheme based on STAR codes is proposed. Due to the characteristic of array codes such as STAR codes, the computation in secret sharing scheme need only XOR operation on GF(2), which is distinguished with the modulation and other complex operation on GF(q) in the traditional schemes. Thus, it's more rapid and suitable for large capacity secret sharing, and also appropriate for resource constrained environments, such as embedded systems. The process of distribution and reconstruction of the secret key in our scheme is depicted in details, and an example of (5, 8) threshold secret sharing scheme based on (8, 5, 4) STAR code is demonstrated. Our scheme is proved to be perfect and ideal.