A Secret Sharing Scheme Based on Binary Addition and Shift Implementable Convolutional Regenerating Code

Secret sharing ensures the security and accuracy of the transmitted information. However, the classic secret sharing scheme has the problem of large time overhead. In this paper, we introduce the Binary Addition and Shift Implementable Convolutional Regenerating Code (BASIC-RGC) to secret sharing and propose a scheme which realizes the essential requirement of (n, k) threshold secret sharing, reduces the time overhead due to the use of binary calculations and could repair lost secret shares through regeneration characteristics. We also adapt the generation of the BASIC-RGC coefficient matrix for processing small secret data to save storage space. Experimental results show that the proposed scheme has the advantage of low computational complexity and small storage usage compared to the classic SHAMIR scheme.