Applying cheating identifiable secret sharing scheme in multimedia security

EURASIP Journal on Image and Video Processing

Yan Ma¹  Xiaohong Huang¹  Zheng Ma²  Manjun Zhang³  Yanxiao Liu⁴ 

[1] Beijing University of Posts and Telecommunications, Beijing, China;Beijing University of Posts and Telecommunications, Beijing, China;China Unicom Network Technology Research Institute, Beijing, China;China Unicom Network Technology Research Institute, Beijing, China;Xi’an University of Technology, 710048, Xi’an, China;

关键词: Multimedia security;    Secret image sharing;    Secret sharing;    Cheating identification;   

DOI  :  10.1186/s13640-020-00529-z

来源: Springer

【 摘 要 】

In (k,n) secret sharing scheme, one secret is encrypted into n shares in such a way that only k or more shares can decrypt the secret. Secret sharing scheme can be extended into the field of multimedia that provides an efficient way to protect confidential information on multimedia. Secret image sharing is just the most important extension of secret sharing that can safely guard the secrecy of images among multiple participants. On the other hand, cheating detection is an important issue in traditional secret sharing schemes that have been discussed for many years. However, the issue of cheating detection in secret image sharing has not been discussed sufficiently. In this paper, we consider the cheating problem in the application of secret image sharing schemes and construct a (k,n) secret image sharing scheme with the ability of cheating detection and identification. Our scheme is capable of identifying cheaters when k participants involve in reconstruction. The cheating identification ability and size of shadow in the proposed scheme are improved from the previous cheating identifiable secret image sharing scheme.

【 授权许可】

CC BY