Extended Secret Image Sharing with Lossless Recovery Based on Chinese Remainder Theorem and Quick Response Code

Extended secret image sharing (SIS) has meaningful shadow, the meaningful shadow will decrease encryption suspiciousness when we transfer secret image via public channels. Chinese Remainder Theorem (CRT) based SIS (CRTSIS) has the advantages of lossless recovery and low recovery computation complexity. Quick Response Code (QR) has become more and more common in our daily life. In this paper, based on CRT and QR, we propose a SIS algorithm for (k, n) threshold with meaningful share and lossless recovery. We choose QR code as the carrier to output valid QR code, which can be scanned to decode. When we collect any k or more shares out of total n shares, the secret image will be recovered losslessly by CRT. We carry out three experiments to illustrate the feasibility and effectiveness of our algorithm.