An Implementation of Image Secret Sharing Scheme Based on Matrix Operations

Abstract

The image secret sharing scheme shares a secret image as multiple shadows. The secret image can be recovered from shadow images that meet a threshold number. However, traditional image secret sharing schemes generally reuse the Lagrange’s interpolation in the recovery stage to obtain the polynomial in the sharing stage. Since the coefficients of the polynomial are the pixel values of the secret image, it is able to recover the secret image. This paper presents an implementation of the image secret sharing scheme based on matrix operations. Different from the traditional image secret sharing scheme, this paper does not use the method of Lagrange’s interpolation in the recovery stage, but first identifies the participants as elements to generate a matrix and calculates its inverse matrix. By repeating the matrix multiplication, the polynomial coefficients of the sharing stage are quickly derived, and then the secret image is recovered. By theoretical analysis and the experimental results, the implementation of secret image sharing based on matrix operation is higher than Lagrange’s interpolation in terms of efficiency.