A novel scheme for lossless authenticated multiple secret images sharing using polynomials and extended visual cryptography

Abstract

Researchers have put forward many variations of schemes for secret image sharing on grounds of visual cryptography and polynomials. The authors of this paper put forward a novel scheme for sharing multiple secret images with perfect reconstruction and authentication for cheating prevention. The perfect reconstruction of all shared secret images is obtained by applying polynomial-based encryption and decryption, and one-time authentication is done for all shared secret images by stacking the intelligible shares created by using extended visual cryptography. Properties' analysis, experimental results and comparisons are given to exhibit the potency of the scheme. This is an open access article under the terms of the Creative Commons Attribution License, which permits use, distribution and reproduction in any medium, provided the original work is properly cited.

Renewal of secret and shadows in secret image sharing

“…When we need to renew based on the original SS, we first need to share the intermediate variable b 0 . The threshold for renewal sharing is (k 2 , n 2 ), and the formula of the SS for sharing intermediate variable b 0 satisfies Equation (3).…”

“…The renewal target is Figure 1c, and its renewed shadow is Figure 6b. The image reconstructed by selecting the renewed shadows with serial numbers X = [3,4] is Figure 6c, which does not get any information. Figure 6d can be obtained by reconstructing the secret image through the renewed shadow, and the serial number is X = [3,4].…”

“…The image reconstructed by selecting the renewed shadows with serial numbers X = [3,4] is Figure 6c, which does not get any information. Figure 6d can be obtained by reconstructing the secret image through the renewed shadow, and the serial number is X = [3,4]. Figure 6 illustrates that the threshold can be reduced by renewing.…”

“…Secret sharing (SS) [1][2][3] is an important tool in cryptography, which constructs many security protocols, such as secure multi-party computation [4], distributed key negotiation [5,6], threshold secret system [7,8] etc. Compared with traditional security methods such as encryption [9], SS has the characteristics of loss tolerance [10], which can solve the problem of loss and damage of encrypted carriers.…”

A new scheme for lossless meaningful visual secret sharing by using XOR properties

“…Two matrices must have the following properties for secret sharing to be efficient. 36,37 1) If we call the vector obtained by stacking any 𝑘 rows out of 𝑛 rows in matrix 𝑀 0 as 𝑉 0 and k rows out of n rows in matrix 𝑀 1 as 𝑉 1 . It should be 𝐻(𝑉 0 ) < 𝐻(𝑉 1 ) where 𝐻(𝑉 ) is hamming weight function.…”