Efficient collusion resistant multi-secret image sharing

Multi-secret image sharing techniques (MSS) extend the secret image sharing schemes. The paper reports a novel MSS scheme designed to be collusion resistant. It starts with a brief introduction of the concept thereafter discussing the related works in the domain. Security is an implicit requirement for MSS techniques. There should be no possibility of collusion among the shareholders. No less than k shareholders for (k, n) MSS scheme should be having even a slight view of the secret from their shares, n being the total number of shareholders. The paper reviews and highlights the security issues like possibility of collusion, randomness issues or robustness against tampering attack in the state-of-the-art works. It proposes a new (n, n) MSS scheme in order to rectify the issues. The algorithm encrypts N different secret images to generate N noisy share images. It resolves the existing problems in a secure, and time efficient manner. A range of experiments specifically time complexity, noise, tampering, collusion and histogram analysis are performed for rigorous security analysis. The results, thus obtained indicated that the algorithm is efficient and preserves the security requirements in a much better way than the existing MSS schemes.