Sharing of multiple images: Economically sized and fast-decoding approach based on modulus and Boolean operations

Secret image sharing is a popular technology to secure digital images in storage and transmission. Traditionally, the technology transforms one secret image into several images called shadows or shares. Later, when the number of collected shadows reaches a specified threshold value, the decomposed image can be reconstructed. We propose a new sharing approach to transform n secret images into n shadows. Later, after gathering all the n shadows, all the n secret images can be retrieved error-free. No information in any secret image is revealed if one shadow is absent. The total size of n generated shadows is identical to the total size of n input secret images; hence, this approach does not waste storage space. Each pixel in each secret image is reconstructed using only one Boolean, one modulus, and two mathematical operations, so it is also a fast approach for reconstructing many secret images. Comparisons are included.