Undetectable least significant bit replacement steganography

Shreelekshmi, R.; Wilscy, M.; Madhavan, C. E. Veni

doi:10.1007/s11042-018-6541-0

Cited by 9 publications

(9 citation statements)

References 21 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Least Significant Bit Substitution (LSB) is one of the most widespread methods that can be easily realized to hide data [18,25]. The LSB substitution method is used in different ways in the literature [21,[26][27][28][29]. Pixel-Value Differencing (PVD) is another method commonly used in image steganography [30].…”

Section: Introductionmentioning

confidence: 99%

Image Steganography-Based GUI Design to Hide Agricultural Data

Solak

Altınışık

2021

Gazi University Journal of Science

View full text Add to dashboard Cite

show abstract

Section: Introductionmentioning

confidence: 99%

Image Steganography-Based GUI Design to Hide Agricultural Data

Solak

Altınışık

2021

Gazi University Journal of Science

View full text Add to dashboard Cite

show abstract

“…The researchers on irreversible data hiding also achieves remarkable results [17][18][19][20][21][22][23][24][25], including the least significant bit (LSB) substitution [17,19], the exploiting modification direction (EMD) [20,21], and the magic matrix based (MMB) schemes [23,24], and so on. In LSB substitution method, LSBs of a cover pixel are replaced by secret binary bits of the same length.…”

Section: Introductionmentioning

confidence: 99%

Adaptive data hiding scheme based on magic matrix of flexible dimension

Wu¹,

Horng²,

Chang³

2021

KSII TIIS

View full text Add to dashboard Cite

Magic matrix-based data hiding schemes are applied to transmit secret information through open communication channels safely. With the development of various magic matrices, some higher dimensional magic matrices are proposed for improving the security level. However, with the limitation of computing resource and the requirement of real time processing, these higher dimensional magic matrix-based methods are not advantageous. Hence, a kind of data hiding scheme based on a single or a group of multi-dimensional flexible magic matrices is proposed in this paper, whose magic matrix can be expanded to higher dimensional ones with less computing resource. Furthermore, an adaptive mechanism is proposed to reduce the embedding distortion. Adapting to the secret data, the magic matrix with least distortion is chosen to embed the data and a marker bit is exploited to record the choice. Experimental results confirm that the proposed scheme hides data with high security and a better visual quality.

show abstract

“…This is not the case with the most secure adaptive methods, which require relatively complex software routines, more computational time, and in many cases additional secret data for complete message extraction. Due to its continued relevance, there has been some effort in recent years to improve the security of LSB embedding against some of the more successful traditional attacks [33], [34], [35], [36], [37], [38], [39], [40]. These efforts have primarily targeted the RS [2] and Sample Pairs analysis (SPA) [3], [4], and have generally sought to evade them by preserving the image statistics they target either by manipulating them prior to or after embedding, or via embedding strategies that preserve them in place.…”

Section: Introductionmentioning

confidence: 99%

“…With apparently normal set cardinalities, structural analyzers will be fooled into concluding that no hidden message is present. This kind of cover modification was presented as a defense against SPA in [40], and we extend it here to include Triples analysis. This extension is not straight-forward: to protect against all orders up to some order k, the statistics of n-tuples must be preserved, where n is the least common multiple of all orders up to and including k. We find that cover modifications in terms of sextuplets, required to preserve the statistics of both pairs and triplets, are highly constrained and result in cover images with virtually zero embedding capacity.…”

Section: Introductionmentioning

confidence: 99%

“…This paper is organized as follows: Section II explores related prior art on the subject of improving the security of LSB embedding against structural steganalysis, and Section III reviews the family of structural steganalysis techniques. In Section IV, we introduce the procedure of cover modification as it is used to secure LSB embedding against SPA in [40], with some new elements necessary for extending it to higher-order. Section V develops the new cover modification procedure to protect against both second-and third-order structural attacks, and presents results of testing on a data set of grayscale and color images.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Securing LSB embedding against structural steganalysis

Powell¹

2020

Preprint

View full text Add to dashboard Cite

This work explores the extent to which LSB embedding can be made secure against structural steganalysis through a modification of cover image statistics prior to message embedding. Natural images possess symmetries that are expressed through approximately equal cardinalities of certain sets of ktuples of consecutive pixels. LSB embedding disturbs this balance and a k th -order structural attack infers the presence of a hidden message with a length in proportion to the size of the imbalance amongst sets of k-tuples. To protect against k th -order structural attacks, cover modifications involve the redistribution of k-tuples among the different sets so that symmetries of the cover image are broken, then repaired through the act of LSB embedding so that the stego image bears the statistics of the original cover.To protect against all orders up to some order k, the statistics of n-tuples must be preserved where n is the least common multiple of all orders ≤ k. We find that this is only feasible for securing against up to 3 rd -order attacks (Sample Pairs and Triples analyses) since higher-order protections result in virtually zero embedding capacities. Securing up to 3 rd -order requires redistribution of sextuplets: rather than perform these 6 th -order cover modifications, which result in tiny embedding capacities, we reduce the problem to the redistribution of triplets in a manner that also preserves the statistics of pairs. This is done by embedding into only certain pixels of each sextuplet, constraining the maximum embedding rate to be ≤ 2/3 bits per channel. Testing on a variety of image formats, we report best performance for JPEG-compressed images with a mean maximum embedding rate undetectable by 2 nd -and 3 rd -order attacks of 0.21 bits per channel.

show abstract

Undetectable least significant bit replacement steganography

Cited by 9 publications

References 21 publications

Image Steganography-Based GUI Design to Hide Agricultural Data

Image Steganography-Based GUI Design to Hide Agricultural Data

Adaptive data hiding scheme based on magic matrix of flexible dimension

Securing LSB embedding against structural steganalysis

Contact Info

Product

Resources

About