Abstract
The disadvantages of the existing lossless recovery algorithms in visual secret sharing (VSS) are that n shadow images or complex computation operation (i.e., Lagrange interpolations) is required in the recovering phase. Inspired by this, a novel mapping-based lossless recovery algorithm (MbLRA) for VSS is proposed in this paper. MbLRA at least has two merits: (1) compared with the previous schemes, less number of shadow images (may be n or less than n) are required in the proceeding of lossless recovery. (2) Secret image can be reconstructed losslessly by using simple addition operation. The MbLRA proves that the condition of lossless recovery is \(\xi 0_n \cap \xi 1_n =\emptyset \) and \(t_r\) is the least number of the shadow images which can recover the secret losslessly by analyzing the Hamming weight of adding all n shadows. Experiments are conducted to evaluate the efficiency of the proposed scheme.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
