Applying cheating identifiable secret sharing scheme in multimedia security

摘要

In (k, n) secret sharing scheme, one secret is encrypted into n shares in such a way thatonly k or more shares can decrypt the secret. Secret sharing scheme can be extendedinto the field of multimedia that provides an efficient way to protect confidentialinformation on multimedia. Secret image sharing is just the most important extensionof secret sharing that can safely guard the secrecy of images among multipleparticipants. On the other hand, cheating detection is an important issue in traditionalsecret sharing schemes that have been discussed for many years. However, the issue ofcheating detection in secret image sharing has not been discussed sufficiently. In thispaper, we consider the cheating problem in the application of secret image sharingschemes and construct a (k, n) secret image sharing scheme with the ability ofcheating detection and identification. Our scheme is capable of identifying cheaterswhen k participants involve in reconstruction. The cheating identification ability andsize of shadow in the proposed scheme are improved from the previous cheatingidentifiable secret image sharing scheme.