Efficient and Lossless Polynomial-Based Secret Image Sharing for Color Images

Qinghong Gong,Lintao Liu,Yongjie Wang,Xuehu Yan

doi:10.1109/access.2019.2934999

Qinghong Gong, Lintao Liu + Show 2 more

Open Access

https://doi.org/10.1109/access.2019.2934999

Copy DOI

Journal: IEEE Access	Publication Date: Jan 1, 2019
Citations: 9	License type: CC BY 4.0

Affiliation: National University of Defense Technology

Abstract

In today's era of developed network, it is particularly important to ensure the security of information. Secret image sharing is a kind of secret information protection technology with loss tolerance by sharing a secret image to a number of shadow images. Most of the researches on secret image sharing focus on grayscale images, but the images we use in our daily life are mostly in color, so the research on the secret image sharing for color image is very meaningful and has great application value. The traditional color image sharing scheme is to share and recover R, G, and B color planes separately, which cause that the time of sharing and recovering one color image is at least triple that of sharing and recovering one grayscale image with the same size as the color image. In this paper, we propose an efficient and lossless secret image sharing scheme for color images. We concatenate the R, G, and B values of every color pixel into a long integer and share it by the polynomial-based secret image sharing, thus the sharing efficiency of color images is greatly improved by reducing the number of sharing operations to 1/3 of the traditional scheme. And we achieve lossless recovery by taking GF(16777259) as the finite field of polynomial operations. 16777259 is the smallest prime number greater than 2 24 - 1, so we intend to screen the random numbers to drop the invalid share values. Theoretical analyses and experiments are used to prove the effectiveness of the proposed scheme.

Highlights

Along with the progress of computer network technique and the coming of information times, almost everyone has a smartphone, and many people have a digital camera
The traditional secret color image sharing scheme is to share and recover the R, G, and B color planes separately [18]–[20], which cause that the time of sharing and recovering one color image is at least triple that of sharing and recovering one grayscale image with the same size as the color image
We propose an efficient and lossless secret sharing scheme for color images based on shamir’s polynomial-based secret sharing scheme

Summary

INTRODUCTION

Along with the progress of computer network technique and the coming of information times, almost everyone has a smartphone, and many people have a digital camera. Thien and Lin’s secret image sharing(SIS) scheme embeds all coefficients with secret pixel values to generate smaller shadow images. Inspired by Thien and Lin, most of the researchers proposed many methods to improve SIS schemes, such as reducing the size of shadow images [11], recovering the original image losslessly [12]–[14] and creating a sharing matrix to implement the sharing operation [15], etc. There are other secret image sharing methods based on China remainder theorem(CRT) [16], [17] These researches focus on grayscale images, but the images we use in our daily life are mostly in color. Analysis and experimental results show that the proposed scheme can improve the efficiency of color image sharing and recovering and effectively realize lossless recovery.

PRELIMINARIES

EFFECT OF PROPOSED SCHEME

CONCLUSION