2014
DOI: 10.1016/j.jisa.2014.10.013
|View full text |Cite
|
Sign up to set email alerts
|

A novel fast and provably secure (t,n)-threshold secret sharing construction for digital images

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
4
0

Year Published

2018
2018
2024
2024

Publication Types

Select...
5

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(4 citation statements)
references
References 27 publications
0
4
0
Order By: Relevance
“…In [8] author proposed (t, n) threshold secret sharing scheme using cryptographic hash function to verify the shared data by authorized shareholder using Shamir's secret sharing scheme [9]. The t number of participants out of n verifies their received share using hashing and master key, which is generated at recipient side to compute shareholder key which helps in constructing the shares.…”
Section: Literature Reviewmentioning
confidence: 99%
See 1 more Smart Citation
“…In [8] author proposed (t, n) threshold secret sharing scheme using cryptographic hash function to verify the shared data by authorized shareholder using Shamir's secret sharing scheme [9]. The t number of participants out of n verifies their received share using hashing and master key, which is generated at recipient side to compute shareholder key which helps in constructing the shares.…”
Section: Literature Reviewmentioning
confidence: 99%
“…In [18], message steganography displayed by joining the transition to-front, tunnels wheeler-change and LZW compression techniques to acquire improved compression capacity of covert content while the carrier medium is alike [17]. In [19], an augmentation of message steganography [8] is exhibited so as to improve implanting limit by the utilization of the Huffman calculation. In [17][18][19] plans spread content picked is not common content that using the arrangement of email-ids as a carrier medium may make defenselessness which might be perceptible as unnatural by the human spectator and can be tempered.…”
Section: Literature Reviewmentioning
confidence: 99%
“…In this [12], an analytical study was presented that a steganography using popular OpenPuff tool can also be detected which implies that a high embedding capacity scheme is not only the parameter for better performance of steganography technique. Threshold secret sharing scheme is presented in [13] that utilize the cryptographic hash procedure to validate the shared information by an authorized shareholder through implementing the secret sharing method of [14]. This scheme is suitable to decompose and reconstruct the secret data among multiple participants with strong security.…”
Section: Related Workmentioning
confidence: 99%
“…In recent years, more threshold-based SIS schemes have been proposed [19], [20]. All of these (k, n) SIS schemes meet two features: (1) less than k shadows reveal no image information, (2) any k shadows can get the entire secret image.…”
Section: Introductionmentioning
confidence: 99%