A novel approach for sharing multiple color images by employing Chinese Remainder Theorem

Conventional approaches for encryption are unsuitable for simultaneously achieving reliability and confidentiality. Threshold-based secret sharing scheme deals with the problem of sharing a secret information into a group of n users and secret can be recovered only when a sufficient users come together, we can reconstruct a secret information from t, where t < n. There is a requirement to evolve a secure secret sharing scheme so that the reconstruction is possible only when all shares are available. In this paper, we propose a secure (n,n)-Multi Secret Sharing (MSS) scheme using Chinese Remainder Theorem (CRT). The proposed scheme shares secret information among n users and for recovery all n users are needed, if one of the user is absent then we could not reconstruct the secret information. The proposed scheme does not reveals the partial secret information, as the randomness in shares is more. The proposed scheme outperforms the existing techniques in terms of randomness and security.