Research of Secret Reconstruction Based on Coding Theory
Tang Da · Dianzi Ke-ji Daxue xuebao · 2016
Most(k,n) threshold secret sharing schemes based on coding theory ignores a case that the number of shares are more than the threshold value k when rebuilding the secret information. Such a case frequently occurs in practical systems based on secret sharing, especially the network data transmission or distributed storage systems. Many experiments have proved that the amount of secret reconstruction computation can be reduced greatly if reasonably using the surplus shares. To solve this problem for secret sharing schemes based on coding theory, this paper proposes a new method of reconstructing the secret which can effectively use all available shares when reconstructing the secret, and computational efficiency has greatly improved compared with the mainstream approaches.