Essential secret image sharing approach with same size of meaningful shares

Yadav, Mano; Singh, Ranvijay

doi:10.1007/s11042-021-10625-5

Cited by 18 publications

(7 citation statements)

References 24 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…However, their approach was unable to achieve lossless recovery of the secret and lacked fault-tolerant capabilities. Several researchers, such as Sardar et al., 11 Wang et al., 12 and Yadav et al., 13 presented schemes having the ability to reconstruct secrets without any loss and possess fault tolerance capabilities. However, the above schemes lack the verification of shares during the reconstruction phase.…”

Section: Related Workmentioning

confidence: 99%

Blockchain-based authenticable (k,n) multi-secret image sharing scheme

Sarkar,

Nag,

Singh

2023

J. Electron. Imag.

View full text Add to dashboard Cite

.We aim to devise a technique to share k number of secret images to n number of participants with ( n ≥ k ) in such a way that only k or more participants can collaborate to get the original k secret images. The proposed approach relies on the development of a spanning tree from a complete graph G for the share image generation in which each of the k pixels retrieved from the k secret images is considered to be one of the k vertices of G. Each of the spanning trees of G is represented by a unique sequence of numbers known as Prufer sequences, and each participant is assigned a random Prufer sequence. The Prufer sequence of a participant is used to generate the share images for that participant. The share images are kept in a blockchain using interplanetary file system. This scheme is suitable for protecting sensitive images through distributed storage while eliminating the single points of failure. Because the blockchain is an immutable decentralized public record, anyone can verify their shares as well as the shares of other participants, thereby preventing cheating by any participant. The scheme presents a lossless reconstruction of k secret images, making it perfect for use in military applications, medical applications, and other applications in which lossless recovery is a crucial element. Extensive experimental analysis confirms that the proposed scheme is secure, cheat proof, and lossless.

show abstract

Section: Related Workmentioning

confidence: 99%

Blockchain-based authenticable (k,n) multi-secret image sharing scheme

Sarkar,

Nag,

Singh

2023

J. Electron. Imag.

View full text Add to dashboard Cite

show abstract

“…Some works on (k, n)-threshold secret image sharing have been proposed [23][24][25][26], in which the secret data can be completely recovered by no less than k shares. However, shadow images are vulnerable to the steganalysis because they are generated based on the same cover image.…”

Section: Introductionmentioning

confidence: 99%

A k,n-Threshold Secret Image Sharing Scheme Based on a Non-Full Rank Linear Model

2022

View full text Add to dashboard Cite

Secret image sharing is a hot issue in the research field of data hiding schemes for digital images. This paper proposes a general k,n threshold secret image sharing scheme, which distributes secret data into n meaningful image shadows based on a non-full rank linear model. The image shadows are indistinguishable from their corresponding distinct cover images. Any k combination of the n shares can perfectly restore the secret data. In the proposed scheme, the integer parameters k,n, with k≤n, can be set arbitrarily to meet the application requirement. The experimental results demonstrate the applicability of the proposed general scheme. The embedding capacity, the visual quality of image shadows, and the security level are satisfactory.

show abstract

“…Essential participants have higher levels of power than non-essential participants when performing image restoration. This concept has since been implemented by many researchers in different ways [6][7][8][9][10], such as polynomial differentiation in (k, n)-SIS to obtain new polynomials [8]. Considering that a dynamic threshold k has a greater role in some cases, Yuan et al first proposed a polynomial-based image secret sharing scheme with variable thresholds in 2016 [11].…”

Section: Introductionmentioning

confidence: 99%

“…A simple way to implement Lagrange's interpolation and construct the polynomial is by solving a linear system of equations. Many researchers just simply adopted this method in the revealing process of the SIS scheme [1][2][3]5,8,[10][11][12]16,17,19,22,23]. In practice, many secret image pixels and a large amount of data require solving many linear systems until all pixels are recovered.…”

Section: Introductionmentioning

confidence: 99%

An Implementation of Image Secret Sharing Scheme Based on Matrix Operations

2022

View full text Add to dashboard Cite

The image secret sharing scheme shares a secret image as multiple shadows. The secret image can be recovered from shadow images that meet a threshold number. However, traditional image secret sharing schemes generally reuse the Lagrange’s interpolation in the recovery stage to obtain the polynomial in the sharing stage. Since the coefficients of the polynomial are the pixel values of the secret image, it is able to recover the secret image. This paper presents an implementation of the image secret sharing scheme based on matrix operations. Different from the traditional image secret sharing scheme, this paper does not use the method of Lagrange’s interpolation in the recovery stage, but first identifies the participants as elements to generate a matrix and calculates its inverse matrix. By repeating the matrix multiplication, the polynomial coefficients of the sharing stage are quickly derived, and then the secret image is recovered. By theoretical analysis and the experimental results, the implementation of secret image sharing based on matrix operation is higher than Lagrange’s interpolation in terms of efficiency.

show abstract

Essential secret image sharing approach with same size of meaningful shares

Cited by 18 publications

References 24 publications

Blockchain-based authenticable (k,n) multi-secret image sharing scheme

Blockchain-based authenticable (k,n) multi-secret image sharing scheme

A k,n-Threshold Secret Image Sharing Scheme Based on a Non-Full Rank Linear Model

An Implementation of Image Secret Sharing Scheme Based on Matrix Operations

Contact Info

Product

Resources

About