Improvements of image sharing with steganography and authentication

Yang, Ching-Nung; Chen, Tse-Shih; Yu, Kun Hsuan; Wang, Chung-Chun

doi:10.1016/j.jss.2006.11.022

Cited by 268 publications

(175 citation statements)

References 9 publications

Supporting

Mentioning

168

Contrasting

Unclassified

Order By: Relevance

“…Yang et al [23] proposed a solution based on Galois Field GF (2 8 ), where the basic polynomial is changed into Equation (2). In Yang and coworkers' scheme, all computations of integers are replaced with operations of polynomials in GF (2 8 ), and there are 256 polynomials in corresponding to integers from 0 to 255.…”

Section: Psis With Lossless Recoverymentioning

confidence: 99%

“…Herein, we provide some comparisons between our proposed scheme and other related typical schemes [4,6,23,24].…”

Section: Comparisons With Related Workmentioning

confidence: 99%

“…In Thien-and-Lin's scheme with lossless recovery [6], they divided pixel values more than 250 into two parts, and then shared two parts with respective sharing phases. Yang et al [23] utilized polynomial-based operations on Galois Field GF(2 8 ) instead of integer computations in the finite field. In Ding and coworkers' scheme [24], pixel values more than 250 also need to be divided, but then both parts are embedded into another two coefficients of the constructed polynomial during one single sharing phase.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Lossless and Efficient Polynomial-Based Secret Image Sharing with Reduced Shadow Size

Zhou

Yan

et al. 2018

Symmetry

View full text Add to dashboard Cite

Thien-and-Lin's polynomial-based secret image sharing (PSIS) is utilized as the basic method to achieve PSISs with better performances, such as meaningful shares, two-in-one property and shares with different priorities. However, this (k, n) threshold PSIS cannot achieve lossless recovery for pixel values more than 250. Furthermore, current solutions to lossless recovery for PSIS have several natural drawbacks, such as large computational costs and random pixel expansion. In this paper, a lossless and efficient (k, n) threshold PSIS scheme with reduced shadow size is presented. For lossless recovery and efficiency, two adjacent pixels are specified as a secret value, the prime in the sharing polynomial is replaced with 65,537, and then the additional screening operation can ensure each shared value in the range [0, 65,535]. To reduce shadows size and improve security, only the first k − 1 coefficients are embedded with secret values and the last coefficient is assigned randomly. To prevent the leakage of secrets, generalized Arnold permutation with special key generating strategy is performed on the secret image prior to sharing process without key distribution. Both theoretical analyses and experiments are conducted to demonstrate the effectiveness of the proposed scheme.

show abstract

Section: Psis With Lossless Recoverymentioning

confidence: 99%

“…Herein, we provide some comparisons between our proposed scheme and other related typical schemes [4,6,23,24].…”

Section: Comparisons With Related Workmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Lossless and Efficient Polynomial-Based Secret Image Sharing with Reduced Shadow Size

Zhou

Yan

et al. 2018

Symmetry

View full text Add to dashboard Cite

show abstract

“…In this technique, offered a scheme to get better authentication capability, thus avert lying participants from fraud. The proposed scheme in addition defines the provision of embedded bits to get better features of stego-image [5].…”

Section: Literature Reviewmentioning

confidence: 99%

A Novel Approach for Improving Security by Digital Signature and Image Steganography

Sharma¹,

Kapoor²

2017

IJCA

View full text Add to dashboard Cite

Information security is becoming more and more vital with the progress in the exchange of data. Protected communication in the network is a key necessity. Propose a novel technique to encrypt the image and embed the digital signature into the image. A digital signature is a procedure used to certify the authenticity and integrity of a message, software and digital documents. It is a also worn to give testimony of non-repudiation of communications. Steganography is an encryption technique that can be used along with cryptography as more-protected method rising to protect data. Images are the most admired cover objects used for steganography. In the province of digital images lots of different image file formats are present. Java technology proposed to authenticate the performance of the proposed model in circumstances of message length, key length, cipher text length and computational time for encryption and decryption.

show abstract

“…To enlarge the hiding storage, the idea of a secret sharing scheme, namely, the (t, n) threshold scheme invented by Shamir [16], was employed and extended to image hiding and authentication [17][18][19][20][21][22][23]. Moreover, to fully recover the host image and losslessly extract the hidden message, researchers [24,25] presented reversible secret image sharing with steganography.…”

Section: Input Blockmentioning

confidence: 99%

Reversible Data Hiding Using Two Marked Images Based on Adaptive Coefficient-Shifting Algorithm

Yang

2012

Advances in Multimedia

View full text Add to dashboard Cite

This paper proposes a novel form of reversible data hiding using two marked images by employing the adaptive coefficient-shifting (ACS) algorithm. The proposed ACS algorithm consists of three parts: the minimum-preserved scheme, the minimum-preserved with squeezing scheme, and the base-value embedding scheme. More specifically, each input block of a host image can be encoded to two stego-blocks according to three predetermined rules by the above three schemes. Simulations validate that the proposed method not only completely recovers the host medium but also losslessly extracts the hidden message. The proposed method can handle various kinds of images without any occurrence of overflow/underflow. Moreover, the payload and peak signal-tonoise ratio (PSNR) performance of the proposed method is superior to that of the conventional invertible data hiding schemes. Furthermore, the number of shadows required by the proposed method is less than that required by the approaches which are based upon secret image sharing with reversible steganography.

show abstract

Improvements of image sharing with steganography and authentication

Cited by 268 publications

References 9 publications

Lossless and Efficient Polynomial-Based Secret Image Sharing with Reduced Shadow Size

Lossless and Efficient Polynomial-Based Secret Image Sharing with Reduced Shadow Size

A Novel Approach for Improving Security by Digital Signature and Image Steganography

Reversible Data Hiding Using Two Marked Images Based on Adaptive Coefficient-Shifting Algorithm

Contact Info

Product

Resources

About