A new (k,n) verifiable secret image sharing scheme (VSISS)

Nag, Amitava; Biswas, Sushanta; Sarkar, Debasree; Sarkar, Partha Pratim

doi:10.1016/j.eij.2014.10.001

Cited by 7 publications

(3 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The proposed SIS scheme extends Nag et al 16 . SIS scheme with additional features of MSIS and verification with immutable blockchain.…”

Section: Preliminariesmentioning

confidence: 81%

“…Although this type of attempt reveals nothing about the secret, it causes a waste of reconstruction resources. To overcome this, in 2017, Nag et al 16 . proposed a verifiable SIS scheme using the Prufer sequence to reconstruct the secret losslessly while detecting fake shares before reconstruction.…”

Section: Related Workmentioning

confidence: 99%

“…16 possible Prufer sequences with four numbers of vertices 16 . (a) A complete graph with four vertices, (b) (1,1), (c) (1, 2), (d) (1, 3), (e) (1, 4), (f) (2, 1), (g) (2, 2), (h) (2, 3), (i) (2, 4), (j) (3, 1), (i) (2, 4), (j) (3, 1), (k) (3, 2), (l) (3, 3), (m) (3, 4), (n) (4, 1), (o) (4, 2), (p) (4, 3), and (q) (4, 4).…”

Section: Preliminariesmentioning

confidence: 99%

See 2 more Smart Citations

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

“…The proposed SIS scheme extends Nag et al 16 . SIS scheme with additional features of MSIS and verification with immutable blockchain.…”

Section: Preliminariesmentioning

confidence: 81%

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

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

SISS‐CSA: Secret image sharing scheme with ciphertext‐based share authentication for malicious model

Bhat,

Jinwala,

Prasad

et al. 2024

Softw Pract Exp

View full text Add to dashboard Cite

We propose a novel secret image sharing scheme with ciphertext‐based share authentication (SISS‐CSA) for sharing grayscale and color secret images in the malicious model. In SISS‐CSA, the dealer and each participant, individually acting as a combiner, can identify each invalid share received from the malicious participant(s) before using it to reconstruct the secret image. This capability, which most comparable schemes lack, prevents reconstructing an incorrect secret image. In SISS‐CSA, the asymptotic time complexities of operations executed by the dealer in the shares generation phase and executed by each combiner in the secret image reconstruction phase are and , respectively. Here, is the number of grayscale values in the secret image, is the number of generated shares, and is the threshold number of shares required for reconstructing the secret image. These asymptotic time complexities and the size of additional information each combiner stores for identifying invalid share(s) are comparatively lesser than those in the state‐of‐the‐art schemes. Furthermore, we obtain a maximum of reduction in the size of additional information each combiner stores for share authentication using the ciphertext‐based share authentication compared to using the standard SHA‐256. To the best of our knowledge, none of the related share authentication approaches achieves this much reduction. We prove the properties of SISS‐CSA using theoretical analysis. We also provide experimental results validating the implications of theoretical analysis corresponding to asymptotic time complexities and the random nature of shares.

show abstract

Cheating Detection in (k, n) Secret Image Sharing Scheme

Yin

2020

Digital Forensics and Watermarking

View full text Add to dashboard Cite

A new (k,n) verifiable secret image sharing scheme (VSISS)

Cited by 7 publications

References 16 publications

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

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

SISS‐CSA: Secret image sharing scheme with ciphertext‐based share authentication for malicious model

Cheating Detection in (k, n) Secret Image Sharing Scheme

Contact Info

Product

Resources

About