Fast Comprehensive Secret Sharing using Naive Image Compression

Abstract

This paper presents a simple method for performing (k,n)-Secret Sharing (SS) with fast computation. It aims to reduce the computational time of the former scheme in the shadow generation process. The former scheme performs SS with the polynomial function computation by involving the color palette. The color palette transforms noisy-like shadow image into more meaningfull appearance. However, this scheme requires a high computational burden on this transformation process. The proposed method exploits naive image compression to decrease the required bit for representing a secret and cover image. It effectively avoids the color palette usage previously used by the former scheme. The proposed method produces a set of shadow images with a cover image-like appearance. In addition, the secret and cover image can be reconstructed by gathering at least k shadow images. As documented in the Experimental Results section, the proposed method yields a promising result in the (k,n)-SS with reduced computational time compared to that of the former scheme.