Reversible data hiding based on three shadow images using rhombus magic matrix

Chen, Sisheng; Chang, Chin‐Chen

doi:10.1016/j.jvcir.2021.103064

Cited by 8 publications

(8 citation statements)

References 27 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…If there are suspicious participants, the one who provides a share that mismatches the reproduced shadow is a cheater. Finally, the secret data can be recovered using Equations ( 20) and (21).…”

Section: System Overviewmentioning

confidence: 99%

See 1 more Smart Citation

A k,n-Threshold Secret Image Sharing Scheme Based on a Non-Full Rank Linear Model

2022

Self Cite

View full text Add to dashboard Cite

Secret image sharing is a hot issue in the research field of data hiding schemes for digital images. This paper proposes a general k,n threshold secret image sharing scheme, which distributes secret data into n meaningful image shadows based on a non-full rank linear model. The image shadows are indistinguishable from their corresponding distinct cover images. Any k combination of the n shares can perfectly restore the secret data. In the proposed scheme, the integer parameters k,n, with k≤n, can be set arbitrarily to meet the application requirement. The experimental results demonstrate the applicability of the proposed general scheme. The embedding capacity, the visual quality of image shadows, and the security level are satisfactory.

show abstract

Section: System Overviewmentioning

confidence: 99%

“…Another series of secret image sharing schemes focusing on sharing secret into multiple image shadows were proposed [20][21][22]. The image shadows are indistinguishable from the cover images and the secret can be perfectly recovered.…”

Section: Introductionmentioning

confidence: 99%

A k,n-Threshold Secret Image Sharing Scheme Based on a Non-Full Rank Linear Model

2022

Self Cite

View full text Add to dashboard Cite

show abstract

“…Thus, there is a need for a tradeoff between transparency and data-hiding capacity [3]. DHTs may also be classified as irreversible and reversible [24][25][26][27][28][29][30][31][32][33][34][35][36][37][38][39][40][41][42][43]. In irreversible DHTs, the distortions to the cover object are permanent, and one can't restore the original cover object after extracting the secret message.…”

Section: Introductionmentioning

confidence: 99%

“…The above-mentioned EMD-based algorithms are irreversible and numerically demanding. Due to the extraction function's cyclic nature, most EMD-based DHTs are irreversible, and one can find a few reversible EMD-based DHTs [24][25][26][27][28][29][30][31][32][33][34][35][36][37][38][39][40][41][42][43]. Reference [24] proposed the first reversible EMD-based DHT using two stego images.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

An Efficient EMD-Based Reversible Data Hiding Technique Using Dual Stego Images

Ali¹

2023

Computers, Materials &Amp; Continua

View full text Add to dashboard Cite

Exploiting modification direction (EMD) based data hiding techniques (DHTs) provide moderate data hiding capacity and high-quality stego images. The overflow problem and the cyclic nature of the extraction function essentially hinder their application in several fields in which reversibility is necessary. Thus far, the few EMD reversible DHTs are complex and numerically demanding. This paper presents a novel EMD-based reversible DHT using dual-image. Two novel 2 × 4 modification lookup tables are introduced, replacing the 256 × 256 reference matrix used in similar techniques and eliminating the numerically demanding search step in similar techniques. In the embedding step, one of the modification tables modifies a pixel in odd columns in the first cover image and keeps its image in the second cover image intact. The other modification table modifies a pixel in even columns in the second cover image and keeps its image in the first cover image intact. This embedding strategy enables direct reversibility at almost zero computational cost. This technique embeds one 4 − ary secret digit into each pixel in the first cover image and its image in the second cover image resulting in one bit per pixel (bpp) data embedding rate. The use of the 4 − ary numbering system enables direct and numerically efficient conversion of the binary secret message to the 4 − ary and vice versa. The advantages of the proposed algorithm are straightforward reversibility, simplicity, numerical efficiency, direct conversion of the binary secret message to 4 − ary and vice versa, and elimination of the need for the 256 × 256 reference matrix by replacing it with two 2 × 4 lookup tables. Simulation results show that the embedding rate of the proposed technique is one bpp. It achieved more than 49 dB average Peak to Signal Noise Ratio (PSNR) over all test images.

show abstract

An enhanced reversible image steganography using distributive Tian's method

Malarvizhi.

Priya

Bhavani

2022

Security and Privacy

View full text Add to dashboard Cite

In recent years, the concept of image encryption and data concealing has become a major area of research that significantly improves the secure communication of images with hidden data in them. The usage of the cloud has been outstanding in several aspects so as its security to ensure privacy over the data stored in it. The concept of reversible image steganography is one such stream where the cloud users are highly relying upon the privacy of the data, they store in the cloud servers. The reversible image steganography has the potential to recover the original image from the stego‐image once the embedded data is extracted. In this research work, an effective distributive Tian's method is proposed to embed the data onto an encrypted image without degrading the performance of the encrypted image. The cross‐verification of lossless image steganography can be identified when the original image is getting extracted from the encrypted image. The result of the proposed method ensures that the distributive Tian's method outperforms the recent state‐of‐art methods. The proposed method is deployed onto six different images in different aspects to ensure its significance.

show abstract

Reversible data hiding based on three shadow images using rhombus magic matrix

Cited by 8 publications

References 27 publications

A k,n-Threshold Secret Image Sharing Scheme Based on a Non-Full Rank Linear Model

A k,n-Threshold Secret Image Sharing Scheme Based on a Non-Full Rank Linear Model

An Efficient EMD-Based Reversible Data Hiding Technique Using Dual Stego Images

An enhanced reversible image steganography using distributive Tian's method

Contact Info

Product

Resources

About