Secret image sharing using (t,n) threshold scheme with lossless recovery

Chien, Ming-Chun; Hwang, Jen-Ing G.

doi:10.1109/cisp.2012.6469950

Cited by 14 publications

(5 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Shamir introduced SS and proposed a scheme based on polynomial interpolation [26], which has been applied in images as PSIS. With simple operation, PSIS is realized by a random (k − 1)-degree polynomial from Shamir's idea, shown as Equation (1). There are prime p and k coefficients denoted by a 0 , a 1 , • • • , a k−1 .…”

Section: Preliminariesmentioning

confidence: 99%

See 1 more Smart Citation

A Novel General (n, n)-Threshold Multiple Secret Images Sharing Scheme Based on Information Hiding in the Sharing Domain

Xing

Yan

et al. 2022

Entropy

View full text Add to dashboard Cite

(k,n)-threshold secret image sharing (SIS) protects an image by dividing it into n shadow images. The secret image will be recovered as we gather k or more shadow images. In complex networks, the security, robustness and efficiency of protecting images draws more and more attention. Thus, we realize multiple secret images sharing (MSIS) by information hiding in the sharing domain (IHSD) and propose a novel and general (n,n)-threshold IHSD-MSIS scheme (IHSD-MSISS), which can share and recover two secret images simultaneously. The proposed scheme spends less cost on managing and identifying shadow images, and improves the ability to prevent malicious tampering. Moreover, it is a novel approach to transmit important images with strong associations. The superiority of (n,n)-threshold IHSD-MSISS is in fusing the sharing phases of two secret images by controlling randomness of SIS. We present a general construction model and algorithms of the proposed scheme. Sufficient theoretical analyses, experiments and comparisons show the effectiveness of the proposed scheme.

show abstract

Section: Preliminariesmentioning

confidence: 99%

“…Secret image sharing (SIS) is a significant branch in multi-party security cryptosystems [1,2], which originates from secret sharing (SS) introduced by Shamir in 1979. (k, n)threshold SS can process private data into n shares managed by different members.…”

Section: Introductionmentioning

confidence: 99%

A Novel General (n, n)-Threshold Multiple Secret Images Sharing Scheme Based on Information Hiding in the Sharing Domain

Xing

Yan

et al. 2022

Entropy

View full text Add to dashboard Cite

show abstract

“…It is also possible to create more complex solutions, including hierarchical [ 10 ], expandable [ 11 , 12 ] or multistage systems [ 13 ]. A majority of schemes use numeric secrets, but there are exceptions, for example matrices [ 14 , 15 ] or images [ 16 ].…”

Section: Secret Sharingmentioning

confidence: 99%

Distributed Steganography in PDF Files—Secrets Hidden in Modified Pages

Koptyra

Ogiela

2020

Entropy

View full text Add to dashboard Cite

This paper shows how to diffuse a message and hide it in multiple PDF files. Presented method uses dereferenced objects and secret splitting or sharing algorithms. It is applicable to various types of PDF files, including text documents, presentations, scanned images etc. Because hiding process is based on structure manipulation, the solution may be easily combined with content-dependent steganographic techniques. The hidden pages are not visible in typical application usage, which was tested with seven different programs.

show abstract

“…A RGB color image still maintains good visual quality, when modified the least four bit of each bit plane. However, previous developed image secret sharing [5][6][7][8] do not consider the fact that the digital images with high redundancy characteristics. Those schemes just divide a digital image with a general secret sharing for data.…”

Section: Introductionmentioning

confidence: 97%

A multiple threshold for image secret sharing based on Cauchy matrix

Yuan¹,

Cai²

2014

The 2014 2nd International Conference on Systems and Informatics (ICSAI 2014)

View full text Add to dashboard Cite

Image secret sharing is an important research topic in the field of information security. Compared to a lot of digital information, images are favored in the network due to having a vivid, visual characteristics. However, most image secret sharing schemes without considering the characteristics of the image just regard the image as a series of general data and directly using the common secret sharing method for data. Based on the fact that the image has a high redundancy characteristic, a multiple threshold image secret sharing scheme is proposed in this paper. The quality of the recovered image varies as the number of shares, and this program with good usability is in authority managements and other aspects.

show abstract

Secret image sharing using (t,n) threshold scheme with lossless recovery

Cited by 14 publications

References 7 publications

A Novel General (n, n)-Threshold Multiple Secret Images Sharing Scheme Based on Information Hiding in the Sharing Domain

A Novel General (n, n)-Threshold Multiple Secret Images Sharing Scheme Based on Information Hiding in the Sharing Domain

Distributed Steganography in PDF Files—Secrets Hidden in Modified Pages

A multiple threshold for image secret sharing based on Cauchy matrix

Contact Info

Product

Resources

About