Applying cheating identifiable secret sharing scheme in multimedia security
- PDF / 1,092,827 Bytes
- 10 Pages / 595 x 794 pts Page_size
- 35 Downloads / 203 Views
(2020) 2020:42
EURASIP Journal on Image and Video Processing
RESEARCH
Open Access
Applying cheating identifiable secret sharing scheme in multimedia security Ma Zheng1,2 , Ma Yan1 , Huang Xiaohong1 , Zhang Manjun2 and Liu Yanxiao3* *Correspondence: [email protected] 3 Xi’an University of Technology, Xi’an, 710048 China Full list of author information is available at the end of the article
Abstract 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. Keywords: Multimedia security, Secret image sharing, Secret sharing, Cheating identification
1 Introduction (k, n) secret sharing (SS) scheme was first proposed by Shamir [1] in 1979 to safeguard secret information among a group of participants. In Shamir’s scheme, a secret s is divided into n shares v1 , v2 , ..., vn using a k − 1 degree polynomial in such a way that any k − 1 or less shares get no information about the secret s and any k or more shares can reconstruct the secret s efficiently. In [2], the researchers designed reliable and secure devices that can realize Shamir’s SS [1]. In 2002, Thien and Lin combined Shamir’s SS scheme with image and proposed a secret image sharing (SIS) scheme [3] that can protect information on secret image among multiple users. After years of research, many SIS schemes were constructed, and all existing SIS schemes can be mainly divided into two categories: one is polynomial-based SIS schemes [4–6], and the other is visual cryptography (VC)-based schemes [7–9]. Polynomial-based SIS schemes can reconstruct lossless image with reduced shadow size; the image reconstruction in VC-based SIS schemes can be © The Author(s). 2020 Open Access This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if
Data Loading...
