An image-in-image communication scheme using secret sharing and M-ary spread spectrum watermarking

Bhattacharjee, Tapasi; Maity, Santi P.

doi:10.1007/s00542-016-3104-z

Cited by 9 publications

(3 citation statements)

References 31 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Bhattacharjee et al's scheme has the characteristics of no key requirements but several cover image requirements, while our scheme only requires an authentication image to be public. Table 1 shows the comparison of the properties between our scheme and the schemes proposed in [21,25]. In particular, compared with traditional schemes, the proposed SIS for the (k, n) threshold achieves the features of mutual shadow authentication, low recovery operation, no pixel expansion and lossless recovery.…”

mentioning

confidence: 99%

See 2 more Smart Citations

Secret Image Sharing with Dealer-Participatory and Non-Dealer-Participatory Mutual Shadow Authentication Capabilities

Jiang

Yan

et al. 2020

Mathematics

View full text Add to dashboard Cite

A ( k , n ) threshold secret image sharing (SIS) method is proposed to divide a secret image into n shadows. The beauty of this scheme is that one can only reconstruct a secret image with k or more than k shadows, but one cannot obtain any information about the secret from fewer than k shadows. In the ( k , n ) threshold SIS, shadow authentication means the detection and location of manipulated shadows. Traditional shadow authentication schemes require additional bits for authentication; need much information to be public; or need to put each shadow into a host image, utilizing the information hiding technique, which makes the generation, recovery and authentication complexity higher. Besides, most existing schemes work when a dealer participates in recovery. Our contribution is that we propose a SIS method for a ( k , n ) threshold with dealer-participatory and non-dealer-participatory mutual shadow authentication capabilities which integrates polynomial-based SIS and visual secret sharing (VSS) through using the result of VSS to “guide” the polynomial-based SIS by a screening operation. In our scheme, when an authentication image is public, all involved actors (participants and dealer) can mutually authenticate each other by exchange the lowest level plane instead of the whole shadow. Our scheme is suitable for the case with and without a dealer participate recovery. In addition, the proposed scheme has characteristics of low generation and authentication complexity, no pixel expansion, 100% detection rate and lossless recovery.

show abstract

mentioning

confidence: 99%

“…Besides, we compare the proposed SIS with Bhattacharjee et al's work [25]. Bhattacharjee et al propose an image-in-image communication scheme which is a data-hiding-based SIS scheme.…”

mentioning

confidence: 99%