A Novel Approach of an (n, n) Multi-Secret Image Sharing Scheme Using Additive Modulo

Abstract

Secret sharing scheme (SSS) is an efficient method of transmitting one or more secret images securely. The conventional SSS share one secret image to n participants. With the advancement of time, there arises a need for sharing multiple secret image. An (n, n)-Multi-Secret Image Sharing (MSIS) scheme is used to encrypt n secret images into n meaningless shared images and stored it in different database servers. For recovery of secrets all n shared images are required. In earlier work n secret images are shared among n or $n+1$ shared images, which has a problem as one can recover fractional information from less than n shared images. Therefore, we need a more efficient and secure (n, n)-MSIS scheme so that less than n shared images do not reveal fractional information. In this paper, we propose an (n, n)-MSIS scheme using additive modulo and reverse bit operation for binary, grayscale, and colored images. The experimental results report that the proposed scheme requires minimal computation time for encryption and decryption. For quantitative analysis Peak Signal to Noise Ratio (PSNR), Correlation, and Root Mean Square Error (RMSE) techniques are used. The proposed (n, n)-MSIS scheme outperforms the existing state-of-the-art techniques.