Enhancing Shamir’s Secret Sharing Using Gaussian Elimination Based on Hybrid Transform (Integer WT-DCT) (original) (raw)
Related papers
Secret Image Sharing Based on Discrete Cosine Transform
INTERNATIONAL JOURNAL OF COMPUTERS & TECHNOLOGY, 2014
The main challenges facing secure image sharing tasks are the increase of sharing volume and sharing-control flexibility. A new scheme based on DCT is developed to perform packet secret image sharing, the DCT is used to reduce the secret image size firstly, then it employs the (k, n) threshold sharing scheme to generate the shadow images. The main signal decomposition attribute of the transform is utilized to divide the secret image into uncorrelated shares. Expermintal results are given to illustrate the characteristic of this methods.
A New Lossless Secret Image Sharing Scheme for Grayscale Images with Small Shadow Size
Advances in Intelligent Systems and Computing, 2020
The current paper offers a lossless (k, n)-threshold scheme with reduced shadow size using the algebraic properties of the polynomial ring Z 251 [x] over the field Z 251. Unlike most of the existing secret image sharing schemes, our scheme does not require any preprocessing steps in order to transform the image into a random image to avoid data leakage from the shares of the secret image. Moreover, the efficiency of our proposed scheme is explained through security analysis and demonstrated through simulation results.
Enhanced Matrix-Based Secret Image Sharing Scheme
2012
Recently, Rey proposed an efficient matrixbased secret image sharing (MSIS) scheme based on simple binary matrix operations. However, the threshold property of Rey's -MSIS scheme is compromised. Elsheh and Hamza showed a weakness that if the ranks of the singular matrices used in Rey's scheme are not low enough then one can retrieve the secret information from only one shadow image. In this paper, we overcome this weakness. Our new -MSIS scheme satisfies the threshold condition, and has low computational complexity for recovery.
A Construction Method of Visual Secret Sharing Schemes for Plural Secret Images
Ieice Transactions on Fundamentals of Electronics Communications and Computer, 2003
In this paper, a new method is proposed to construct a visual secret sharing scheme with a general access structure for plural secret images. Although the proposed scheme can be considered as an extension of Droste's method that can encode only black-white images, it can encode plural gray-scale and/or color secret images.
Digital Signal Processing, 2015
Traditional secret sharing scheme that encrypts secret image based on mathematical calculation to construct shadows often requires the complicated computation to extract the secret. Later on, conventional visual cryptography scheme was developed to deal with the perplexed calculation in encryption and extraction of previous schemes. The stack-to-see technique can be used easily to reveal the secret by human visual system, which can shorten computation time. However, the expansion of image size and the noise-liked shares of previous schemes lead to the difficulty in transmission and storage. This study uses a pre-defined codebook to encode two secret images into two meaningful transparencies without pixel expansion. According to the turning mechanism, two secret images can be embedded into two shares simultaneously. The decryption process allows the user to get two secrets via turning and stacking. A notable feature of our scheme is that the black pixel value of the secret image can be completely extracted and the vision quality of stacking results can be identified clearly.
Visual Secret Sharing Scheme using Grayscale Images
Pixel expansion and the quality of the reconstructed secret image has been a major issue of visual secret sharing (VSS) schemes. A number of probabilistic VSS schemes with minimum pixel expansion have been proposed for black and white (binary) secret images.
A Novel (2,n) Secret Image Sharing Scheme
Procedia Technology, 2012
In this paper, we propose a novel and simple (2, n) secret sharing scheme with precise reconstruction for grayscale, binary and color image. The share construction phase is based on pixel division and XOR operation. The reconstruction is based on XOR and OR operation. The proposed scheme has no pixel expansion and can reconstruct the secret image precisely. This scheme can be directly applied to share grayscale images and can be easily extended to deal with binary and color images. Experimental results prove that the proposed scheme is efficient because of strong security and accuracy.
Secure and efficient arithmetic-based multi-secret image sharing scheme using universal share
Journal of Information Security and Applications, 2019
Visual secret sharing (VSS) scheme is an encryption technique to hide secret message into two or more meaningless images, called as shares. Shares are stack together to decrypt the secret message using human visual system. To share many secrets, multi-secret image sharing schemes are often used. Diversity in sharing multiple secrets is using the universal share. Company organizer shares multiple secret images using this common share. Computation cost is the major drawback of such scheme. This study presents computationally efficient arithmetic-based multi-secret image sharing scheme using the universal share. Binary arithmetic-based scheme utilizes distinct value selecting function while encoding and decoding of secret images. Distinct value selecting function enhances randomness property of shares and fulfills threshold property. Thus, the proposed method provides computationally efficient method while satisfying threshold security criteria.