Pixel-based Visual Secret Sharing Using Lorenz System

(n, n)-Visual Secret Sharing (VSS) allows a user to send an image in the form of shares to different participants. Every share can not reveal the secret alone, and only all shares together can reveal the secret with fast recovery. This paper proposes a pixel-based (n, n)-VSS system, where to share a pixel from the secret image, (n − 1) random pixels are generated from the Lorenz chaotic system for a varying set of (n − 1) shares. Then, the nth pixel is calculated for a random share using the secret pixel and the generated (n − 1) random pixels. The system is efficient, lossless, implemented for grayscale and color images, and has a simple XOR-based recovery scheme. It passed several security analysis tests and is robust against noise attacks. Moreover, performance analysis and comparisons with other VSS systems are presented, showing good results.