Weighted Polynomial-Based Secret Image Sharing Scheme with Lossless Recovery

Yongjie Wang,Qinghong Gong,Yuyuan Sun,Jia Chen,Xuehu Yan,Jialiang Peng

doi:10.1155/2021/5597592

Abstract

In some particular scenes, the shadows need to be given different weights to represent the participants’ status or importance. And during the reconstruction, participants with different weights obtain various quality reconstructed images. However, the existing schemes based on visual secret sharing (VSS) and the Chinese remainder theorem (CRT) have some disadvantages. In this paper, we propose a weighted polynomial-based SIS scheme in the field of GF (257). We use k , k threshold polynomial-based secret image sharing (SIS) to generate k shares and assign them corresponding weights. Then, the remaining n − k shares are randomly filled with invalid value 0 or 255. When the threshold is satisfied, the number and weight of share can affect the reconstructed image’s quality. Our proposed scheme has the property of lossless recovery. And the average light transmission of shares in our scheme is identical. Experiments and theoretical analysis show that the proposed scheme is practical and feasible. Besides, the quality of the reconstructed image is consistent with the theoretical derivation.

Highlights

With the development of Internet technology and digital multimedia technology, digital images are more and more widely used
Steganography improves the security of images, making it difficult for attackers to detect the existence of secret information
Compared with Tan’s scheme, we overcome the problem that the average light transmissions of shares are not identical

Summary

Introduction

With the development of Internet technology and digital multimedia technology, digital images are more and more widely used. In the VCS field, current researches focus on these areas, including improving the visual quality of reconstructed images [11, 12], Security and Communication Networks implementing general access structures [13, 14], share authentication [15], and meaningful shadow images [16,17,18]. Each share has a weight in their scheme, and the secret image can be recovered by OR and XOR operations. Tan et al [23] proposed a weighted (k, n)-threshold SIS scheme based on the CRT for sharing grayscale images. The weighted schemes based on VSS are lossy and can only share the binary images, not grayscale images. We propose a weighted polynomial-based SIS scheme with lossless recovery.

Preliminaries

The Proposed Scheme

Participants

Experiment and Evaluation

Conclusion