[go: up one dir, main page]
More Web Proxy on the site http://driver.im/
You seem to have javascript disabled. Please note that many of the page functionalities won't work as expected without javascript enabled.
 
 
Sign in to use this feature.

Years

Between: -

Subjects

remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline

Journals

Article Types

Countries / Regions

Search Results (77)

Search Parameters:
Keywords = secret image sharing

Order results
Result details
Results per page
Select all
Export citation of selected articles as:
22 pages, 28158 KiB  
Article
Edge-Aware Dual-Task Image Watermarking Against Social Network Noise
by Hao Jiang, Jiahao Wang, Yuhan Yao, Xingchen Li, Feifei Kou, Xinkun Tang and Limei Qi
Appl. Sci. 2025, 15(1), 57; https://doi.org/10.3390/app15010057 - 25 Dec 2024
Abstract
In the era of widespread digital image sharing on social media platforms, deep-learning-based watermarking has shown great potential in copyright protection. To address the fundamental trade-off between the visual quality of the watermarked image and the robustness of watermark extraction, we explore the [...] Read more.
In the era of widespread digital image sharing on social media platforms, deep-learning-based watermarking has shown great potential in copyright protection. To address the fundamental trade-off between the visual quality of the watermarked image and the robustness of watermark extraction, we explore the role of structural features and propose a novel edge-aware watermarking framework. Our primary innovation lies in the edge-aware secret hiding module (EASHM), which achieves adaptive watermark embedding by aligning watermarks with image structural features. To realize this, the EASHM leverages knowledge distillation from an edge detection teacher and employs a dual-task encoder that simultaneously performs edge detection and watermark embedding through maximal parameter sharing. The framework is further equipped with a social network noise simulator (SNNS) and a secret recovery module (SRM) to enhance robustness against common image noise attacks. Extensive experiments on three public datasets demonstrate that our framework achieves superior watermark imperceptibility, with PSNR and SSIM values exceeding 40.82 dB and 0.9867, respectively, while maintaining an over 99% decoding accuracy under various noise attacks, outperforming existing methods by significant margins. Full article
(This article belongs to the Topic Intelligent Image Processing Technology)
Show Figures

Figure 1

Figure 1
<p>Framework overview of the proposed digital watermarking framework, including three key components: Edge-Aware Secret Hiding Module (EASHM), Social Network Noise Simulator (SNNS), and Secret Recovery Module (SRM).</p>
Full article ">Figure 2
<p>Secret diffusion process. The pipeline of it consists of transforming the binary secret message <math display="inline"><semantics> <msub> <mi>M</mi> <mrow> <mi>s</mi> <mi>e</mi> <mi>c</mi> </mrow> </msub> </semantics></math> through linear mapping, followed by reshape and upscaling operations to generate the information image <math display="inline"><semantics> <msub> <mi>I</mi> <mrow> <mi>s</mi> <mi>e</mi> <mi>c</mi> </mrow> </msub> </semantics></math>, which matches the dimensions of the cover image <math display="inline"><semantics> <msub> <mi>I</mi> <mrow> <mi>c</mi> <mi>o</mi> <mi>v</mi> </mrow> </msub> </semantics></math>.</p>
Full article ">Figure 3
<p>Visual examples illustrating the edge-aware secret hiding module’s performance, displaying the cover image (<math display="inline"><semantics> <msub> <mi>I</mi> <mrow> <mi>c</mi> <mi>o</mi> <mi>v</mi> </mrow> </msub> </semantics></math>), watermarked image (<math display="inline"><semantics> <msub> <mi>I</mi> <mrow> <mi>w</mi> <mi>m</mi> </mrow> </msub> </semantics></math>), edge detection teacher output (<math display="inline"><semantics> <msub> <mi>E</mi> <mrow> <mi>t</mi> <mi>e</mi> <mi>a</mi> <mi>c</mi> <mi>h</mi> </mrow> </msub> </semantics></math>), edge detection output (<math display="inline"><semantics> <msub> <mi>E</mi> <mrow> <mi>p</mi> <mi>r</mi> <mi>e</mi> <mi>d</mi> </mrow> </msub> </semantics></math>), and watermark embedding output (<math display="inline"><semantics> <msub> <mi>I</mi> <mrow> <mi>h</mi> <mi>i</mi> <mi>d</mi> <mi>e</mi> </mrow> </msub> </semantics></math>) from top to bottom.</p>
Full article ">Figure 4
<p>A typical propagation scenario of a watermarked image through social networks and editing tools.</p>
Full article ">Figure 5
<p>Visualization of noise attacks simulated by SNNS. The left panel shows the cover image <math display="inline"><semantics> <msub> <mi>I</mi> <mrow> <mi>c</mi> <mi>o</mi> <mi>v</mi> </mrow> </msub> </semantics></math> and the watermarked image <math display="inline"><semantics> <msub> <mi>I</mi> <mrow> <mi>w</mi> <mi>m</mi> </mrow> </msub> </semantics></math>. The right panel shows the effects of different noise attacks from <math display="inline"><semantics> <mrow> <mi>SNNS</mi> <msup> <mrow> <mi>pool</mi> </mrow> <mrow> <mi>single</mi> </mrow> </msup> </mrow> </semantics></math>, where the upper row displays the noise-attacked watermarked images <math display="inline"><semantics> <mrow> <mi>N</mi> <mi>I</mi> <mrow> <mi>w</mi> <mi>m</mi> </mrow> </mrow> </semantics></math> and the lower row shows the corresponding residual maps <math display="inline"><semantics> <mrow> <mrow> <mo>|</mo> <mi>N</mi> </mrow> <msub> <mi>I</mi> <mrow> <mi>w</mi> <mi>m</mi> </mrow> </msub> <mo>−</mo> <msub> <mi>I</mi> <mrow> <mi>w</mi> <mi>m</mi> </mrow> </msub> <mrow> <mo>|</mo> </mrow> </mrow> </semantics></math> for cases (<b>a</b>–<b>h</b>). While the framework implements cropout and dropout, which require cover image information, we demonstrate their effects using simpler crop and drop operations for clearer interpretation of the noise patterns.</p>
Full article ">
15 pages, 4739 KiB  
Article
RADH-A Reversible and Authenticable Data Hiding Scheme in Encrypted Domain Based on Image Interpolation and Substitution
by Chia-Chen Lin, Rong-Ze Chen, Wei-Liang Tai and Chun-Jung Lin
Appl. Sci. 2024, 14(23), 11083; https://doi.org/10.3390/app142311083 - 28 Nov 2024
Viewed by 441
Abstract
The rise of the Internet has transformed communication and information access, but it also raises serious privacy concerns, especially regarding personal image sharing. This paper presents a novel reversible and authenticable data-hiding scheme for encrypted images that utilizes interpolation techniques and substitution methods. [...] Read more.
The rise of the Internet has transformed communication and information access, but it also raises serious privacy concerns, especially regarding personal image sharing. This paper presents a novel reversible and authenticable data-hiding scheme for encrypted images that utilizes interpolation techniques and substitution methods. Our encryption system achieves a lower correlation among neighboring pixels, ensuring a more uniform distribution in the encrypted image. The stego images do not reveal any information about the original cover image or secret data. The embedded authentication data provides the ability to verify the authenticity of the image and localize the tampering. Experimental results show that our scheme can securely protect an image from unauthorized access and verify its authenticity. Full article
(This article belongs to the Special Issue Recent Advances in Multimedia Steganography and Watermarking)
Show Figures

Figure 1

Figure 1
<p>The flowchart of the proposed scheme.</p>
Full article ">Figure 2
<p>Diagram of image interpolation.</p>
Full article ">Figure 3
<p>Neighboring 3 × 3 blocks on both sides of the diagonal.</p>
Full article ">Figure 4
<p>Test images: (<b>a</b>) peppers; (<b>b</b>) deer; (<b>c</b>) dance; (<b>d</b>) city.</p>
Full article ">Figure 5
<p>Test results: (<b>a</b>) original peppers image; (<b>b</b>) encrypted image; (<b>c</b>) stego image; (<b>d</b>) restored image.</p>
Full article ">Figure 6
<p>The pixel correlation of the original image ‘Peppers’: (<b>a</b>) horizontal direction; (<b>b</b>) vertical direction; (<b>c</b>) diagonal direction; (<b>d</b>) anti-diagonal direction.</p>
Full article ">Figure 7
<p>The pixel correlation of the encrypted image ‘Peppers’: (<b>a</b>) horizontal direction; (<b>b</b>) vertical direction; (<b>c</b>) diagonal direction; (<b>d</b>) anti-diagonal direction.</p>
Full article ">Figure 8
<p>Histogram analysis of the original image: (<b>a</b>) peppers; (<b>b</b>) deer; (<b>c</b>) dance; (<b>d</b>) city.</p>
Full article ">Figure 9
<p>Histogram analysis of the encrypted image: (<b>a</b>) peppers; (<b>b</b>) deer; (<b>c</b>) dance; (<b>d</b>) city.</p>
Full article ">Figure 10
<p>Two types of collage attacks: (<b>a</b>) the first attack; (<b>b</b>) the second attack.</p>
Full article ">Figure 11
<p>The tamper results of “Pepper”: (<b>a</b>) the first attack; (<b>b</b>) the second attack.</p>
Full article ">
18 pages, 2724 KiB  
Article
MRA-VSS: A Matrix-Based Reversible and Authenticable Visual Secret-Sharing Scheme Using Dual Meaningful Images
by Chia-Chen Lin, En-Ting Chu, Ya-Fen Chang and Ersin Elbasi
Mathematics 2024, 12(22), 3532; https://doi.org/10.3390/math12223532 - 12 Nov 2024
Viewed by 478
Abstract
Reversible data hiding (RDH) is an approach that emphasizes the imperceptibility of hidden confidential data and the restoration of the original cover image. To achieve these objectives at the same time, in this paper, we design a matrix-based crossover data hiding strategy and [...] Read more.
Reversible data hiding (RDH) is an approach that emphasizes the imperceptibility of hidden confidential data and the restoration of the original cover image. To achieve these objectives at the same time, in this paper, we design a matrix-based crossover data hiding strategy and then propose a novel matrix-based RDH scheme with dual meaningful image shadows, called MRA-VSS (matrix-based reversible and authenticable visual secret-sharing). Each pixel in a secret image is divided into two parts, and each part is embedded into a cover pixel pair by referring to the intersection point of four overlapping frames. During the share construction phase, not only partial information of the pixel in a secret image but also authentication codes are embedded into the corresponding cover pixel pair. Finally, two meaningful image shadows are derived. The experimental results confirm that our designed MRA-VSS successfully embeds pixels’ partial information and authentication code into cover pixel pairs at the cost of slight distortion during data hiding. Nevertheless, the robustness of our scheme under the steganalysis attack and the authentication capability of our scheme are also proven. Full article
(This article belongs to the Section Engineering Mathematics)
Show Figures

Figure 1

Figure 1
<p>Diagram for Chang et al.’s candidate elements’ selection.</p>
Full article ">Figure 2
<p>Flowchart of our proposed dual-image-based RDH called MRA-VSS.</p>
Full article ">Figure 3
<p>Example of an intersection point for a cover pixel pair (4, 5) and four corresponding embedding frames. The red frame is the top-right frame, the green frame is the top-left frame, the yellow frame is the bottom-left frame, and the blue frame is the bottom-right frame.</p>
Full article ">Figure 4
<p>Example of the Euclidean distance between the stego pixel pairs (<span class="html-italic">P’</span><sub>1<span class="html-italic">i</span></sub>, <span class="html-italic">P’</span><sub>1<span class="html-italic">j</span></sub>) and (<span class="html-italic">P’</span><sub>2<span class="html-italic">i</span></sub>, <span class="html-italic">P’</span><sub>2<span class="html-italic">j</span></sub>). Four corresponding embedding frames are denoted as Red, Green, Yellow, and Blue. The red frame is the top-right frame, the green frame is the top-left frame, the yellow frame is the bottom-left frame, and the blue frame is the bottom-right frame.</p>
Full article ">Figure 5
<p>The eight test images with the size of 512 × 512 pixels. (<b>a</b>) Airplane. (<b>b</b>) Boat. (<b>c</b>) Girl. (<b>d</b>) Goldhill. (<b>e</b>) Lena. (<b>f</b>) Lake. (<b>g</b>) Tiffany. (<b>h</b>) Zelda.</p>
Full article ">Figure 6
<p>Detection results of the collage attack with the share “Zelda”: (<b>a</b>) Original share “Zelda”; (<b>b</b>) tampered “Zelda”; and (<b>c</b>) identified tampered region.</p>
Full article ">Figure 7
<p>RS analysis for the dual stego images of “Boat” and “Lena”. (<b>a</b>) The stego image <span class="html-italic">SI1</span> of “Boat”. (<b>b</b>) The stego image <span class="html-italic">SI2</span> of “Boat”. (<b>c</b>) The stego image <span class="html-italic">SI1</span> of “Lena”. (<b>d</b>) The stego image <span class="html-italic">SI2</span> of “Lena”.</p>
Full article ">Figure 8
<p>PDH analysis results of four cover images and their stego images. (<b>a</b>) Boat. (<b>b</b>) Goldhill. (<b>c</b>) Lena. (<b>d</b>) Zelda.</p>
Full article ">
20 pages, 10850 KiB  
Article
Reversible Data Hiding in Crypto-Space Images with Polynomial Secret Sharing over Galois Field
by Hao-Wei Lu, Jui-Chuan Liu, Chin-Chen Chang and Ji-Hwei Horng
Electronics 2024, 13(14), 2860; https://doi.org/10.3390/electronics13142860 - 20 Jul 2024
Viewed by 793
Abstract
Secret sharing is a data security technique that divides secret information into multiple parts, embeds these parts into various shares, and distributes these shares to different participants. The original secret information can be retrieved only when the number of shares gathered meets a [...] Read more.
Secret sharing is a data security technique that divides secret information into multiple parts, embeds these parts into various shares, and distributes these shares to different participants. The original secret information can be retrieved only when the number of shares gathered meets a required threshold. This paper proposes a secret sharing method that can hide data in encrypted images with reversibility and allows content owners to add an additional layer of security before uploading data to the cloud. This method enables the independent extraction of images and data, ensuring that the recovered images and extracted data can serve as validation information for each other. The proposed method not only enhances data security but also guarantees the accuracy of the extracted information. Full article
(This article belongs to the Special Issue Recent Advances in Information Security and Data Privacy)
Show Figures

Figure 1

Figure 1
<p>Framework of the proposed method with a (3, 4)-threshold. The locations marked by red indicate secret messages are embedded.</p>
Full article ">Figure 2
<p>The small blocks are denoted by labels according to their positions.</p>
Full article ">Figure 3
<p>Data extraction and image recovery.</p>
Full article ">Figure 4
<p>Example of proposed methods with (3, 4)-threshold.</p>
Full article ">Figure 5
<p>Example of recovering image with (3, 4)-threshold.</p>
Full article ">Figure 6
<p>Encryption and embedded result with (3, 4)-threshold.</p>
Full article ">Figure 7
<p>Recovered images from different shares with (3, 4)-threshold and 4 × 4 size.</p>
Full article ">Figure 8
<p>Histogram of the original image and its four steganographic shared images.</p>
Full article ">Figure 9
<p>(<b>a</b>) Recovered image from a single compromised image with (3, <span class="html-italic">n</span>)-threshold. (<b>b</b>) Parts of the recovered image that may be restored incorrectly are marked in white (pixel value 255).</p>
Full article ">Figure 10
<p>Recovered image from a single compromised image with (4, <span class="html-italic">n</span>) threshold.</p>
Full article ">Figure 11
<p>Using a logo of Feng Chia University as a secret message.</p>
Full article ">Figure 12
<p>Extracted logo secret messages from a single compromised image. (<b>a</b>) The first repeated logo secret message. (<b>b</b>) The second repeated logo secret message. (<b>c</b>) The third repeated logo secret message.</p>
Full article ">Figure 13
<p>The result of the joint restoration of multiple extract logo secret messages.</p>
Full article ">
16 pages, 16154 KiB  
Article
A Hierarchical Authorization Reversible Data Hiding in Encrypted Image Based on Secret Sharing
by Chao Jiang, Minqing Zhang, Yongjun Kong, Zongbao Jiang and Fuqiang Di
Mathematics 2024, 12(14), 2262; https://doi.org/10.3390/math12142262 - 19 Jul 2024
Viewed by 779
Abstract
In the current distributed environment, reversible data hiding in encrypted domain (RDH-ED) cannot grant corresponding privileges according to users’ identity classes. To address this issue, this paper proposes a hierarchical authorization structure embedding scheme based on secret image sharing (SIS) and users’ hierarchical [...] Read more.
In the current distributed environment, reversible data hiding in encrypted domain (RDH-ED) cannot grant corresponding privileges according to users’ identity classes. To address this issue, this paper proposes a hierarchical authorization structure embedding scheme based on secret image sharing (SIS) and users’ hierarchical identities. In the first embedding, the polynomial coefficient redundancy generated in the encryption process of the SIS is utilized by the image owner. For the second, the participants are categorized into two parts. One is core users with adaptive difference reservation embedding, and the other is ordinary users with pixel bit replacement embedding. At the time of reconstruction, more than one core user must provide pixel differences, which grants more privileges to core users. The experimental results demonstrate that the average embedding rate (ER) of the test images is 4.3333 bits per pixel (bpp) in the (3, 4) threshold scheme. Additionally, the reconstructed image achieves a PSNR of +∞ and an SSIM of 1. Compared to existing high-performance RDH-ED schemes based on secret sharing, the proposed scheme with a larger ER maintains strong security and reversibility. Moreover, it is also suitable for multiple embeddings involving multilevel participant identities. In conclusion, the results underscore the efficacy of our technique in achieving both security and performance objectives within a complex distributed setting. Full article
(This article belongs to the Special Issue Information Security and Image Processing)
Show Figures

Figure 1

Figure 1
<p>The procedures of the proposed RDH-ED schemes.</p>
Full article ">Figure 2
<p>Framework description of an image block.</p>
Full article ">Figure 3
<p>Embedding rules of core users.</p>
Full article ">Figure 4
<p>An instance of the proposed scheme.</p>
Full article ">Figure 5
<p>Test images.</p>
Full article ">Figure 6
<p>Histograms of Baboon. (<b>a</b>) Original image; (<b>b</b>) encrypted image; (<b>c</b>) marked image; (<b>d</b>) reconstructed image; (<b>e</b>–<b>h</b>) plane histogram; (<b>i</b>–<b>l</b>) scatter plot histogram; (<b>m</b>–<b>p</b>) 3D histogram.</p>
Full article ">Figure 7
<p>Shannon entropy of different images [<a href="#B26-mathematics-12-02262" class="html-bibr">26</a>].</p>
Full article ">Figure 8
<p>PSNR and SSIM of different images. (<b>a</b>) PSNR of different images; (<b>b</b>) SSIM of different images.</p>
Full article ">Figure 9
<p>The pixel correlation of the first encrypted image.</p>
Full article ">Figure 10
<p>The pixel correlation of the first marked image.</p>
Full article ">Figure 11
<p>Comparison of the ER for different images at different thresholds [<a href="#B4-mathematics-12-02262" class="html-bibr">4</a>,<a href="#B23-mathematics-12-02262" class="html-bibr">23</a>,<a href="#B24-mathematics-12-02262" class="html-bibr">24</a>,<a href="#B26-mathematics-12-02262" class="html-bibr">26</a>,<a href="#B27-mathematics-12-02262" class="html-bibr">27</a>].</p>
Full article ">Figure 12
<p>Error maps of S<sub>1</sub>, S<sub>2,</sub> and S<sub>3</sub>. (<b>a</b>) Error maps of S<sub>1</sub>; (<b>b</b>) Error maps of S<sub>2</sub>; (<b>c</b>) Error maps of S<sub>3</sub>.</p>
Full article ">
25 pages, 5695 KiB  
Article
Reversible Data Hiding Algorithm in Encrypted Images Based on Adaptive Median Edge Detection and Matrix-Based Secret Sharing
by Zongbao Jiang, Minqing Zhang, Weina Dong, Chao Jiang and Fuqiang Di
Appl. Sci. 2024, 14(14), 6267; https://doi.org/10.3390/app14146267 - 18 Jul 2024
Viewed by 773
Abstract
Reversible data hiding in encrypted images (RDH-EI) schemes based on secret sharing have emerged as a significant area of research in privacy protection. However, existing algorithms have limitations, such as low embedding capacity and insufficient privacy protection. To address these challenges, this paper [...] Read more.
Reversible data hiding in encrypted images (RDH-EI) schemes based on secret sharing have emerged as a significant area of research in privacy protection. However, existing algorithms have limitations, such as low embedding capacity and insufficient privacy protection. To address these challenges, this paper proposes an RDH-EI scheme based on adaptive median edge detection (AMED) and matrix-based secret sharing (MSS). The algorithm creatively leverages the AMED technique for precise image prediction and then integrates the (r, n)-threshold MSS scheme to partition the image into n encrypted images. Simultaneously, it embeds identifying information during segmentation to detect potential attacks during transmission. The algorithm allows multiple data hiders to embed secret data independently. Experimental results demonstrate that the proposed algorithm significantly enhances the embedding rate while preserving reversibility compared to current algorithms. The average maximum embedding rates achieved are up to 5.8142 bits per pixel (bpp) for the (3, 4)-threshold scheme and up to 7.2713 bpp for the (6, 6)-threshold scheme. With disaster-resilient features, the algorithm ensures (nr) storage fault tolerance, enabling secure multi-party data storage. Furthermore, the design of the identifying information effectively evaluates the security of the transmission environment, making it suitable for multi-user cloud service scenarios. Full article
(This article belongs to the Special Issue Recent Advances in Multimedia Steganography and Watermarking)
Show Figures

Figure 1

Figure 1
<p>Application scenarios of double-blind IPR. (<b>a</b>) Traditional review application scenario. (<b>b</b>) New review application scenario with error detection functionality.</p>
Full article ">Figure 2
<p>Pixel prediction block segmentation.</p>
Full article ">Figure 3
<p>Algorithm framework diagram.</p>
Full article ">Figure 4
<p>An example of calculating the label value of a pixel.</p>
Full article ">Figure 5
<p>Six commonly used images in experiments. (<b>a</b>) Airplane. (<b>b</b>) Baboon. (<b>c</b>) Jetplane. (<b>d</b>) Lena. (<b>e</b>) Man. (<b>f</b>) Tiffany.</p>
Full article ">Figure 6
<p>Images generated during the experiment. (<b>a</b>) Original image. (<b>b</b>) Encrypted image. (<b>c</b>) Marked encrypted image I. (<b>d</b>) Marked encrypted image II. (<b>e</b>) Marked encrypted image III. (<b>f</b>) Marked encrypted image IV. (<b>g</b>) Recovered image.</p>
Full article ">Figure 7
<p>Comparison chart of PSNR variations at different ERs. [<a href="#B5-applsci-14-06267" class="html-bibr">5</a>,<a href="#B7-applsci-14-06267" class="html-bibr">7</a>,<a href="#B14-applsci-14-06267" class="html-bibr">14</a>,<a href="#B18-applsci-14-06267" class="html-bibr">18</a>,<a href="#B21-applsci-14-06267" class="html-bibr">21</a>].</p>
Full article ">Figure 8
<p>Performance of the algorithm’s ERs Across different databases. (<b>a</b>) ERs on the BOSSBase database. (<b>b</b>) ERs on the BOWS-2 database. (<b>c</b>) ERs on the UCID database.</p>
Full article ">Figure 9
<p>Comparison of ERs between the proposed algorithm and existing algorithms. [<a href="#B5-applsci-14-06267" class="html-bibr">5</a>,<a href="#B14-applsci-14-06267" class="html-bibr">14</a>,<a href="#B21-applsci-14-06267" class="html-bibr">21</a>,<a href="#B22-applsci-14-06267" class="html-bibr">22</a>,<a href="#B23-applsci-14-06267" class="html-bibr">23</a>,<a href="#B24-applsci-14-06267" class="html-bibr">24</a>].</p>
Full article ">Figure 10
<p>Comparison experiment of information extraction versus pre-embedding information. (<b>a</b>) Comparison experiment I of secret data. (<b>b</b>) Comparison experiment II of secret data. (<b>c</b>) Comparison experiment I of identifying information. (<b>d</b>) Comparison experiment II of identifying information. (<b>e</b>) Comparison experiment III of identifying information. (<b>f</b>) Comparison experiment IV of identifying information.</p>
Full article ">Figure 11
<p>Results of pixel distribution in experimental images. (<b>a</b>) Histogram of the original image. (<b>b</b>) 3D pixel distribution of the original image. (<b>c</b>) Histogram of the encrypted image. (<b>d</b>) 3D pixel distribution of the encrypted image. (<b>e</b>–<b>j</b>) Pixel distribution and of the marked encrypted images I, II, III. (<b>k</b>) Histogram of the original image. (<b>l</b>) 3D pixel distribution of the recovered image.</p>
Full article ">Figure 12
<p>Scatter plot of correlation coefficient of test images. (<b>a</b>) Horizontal distribution of the original image. (<b>b</b>) Horizontal distribution of the marked encrypted image. (<b>c</b>) Vertical distribution of the original image. (<b>d</b>) Vertical distribution of the marked encrypted image. (<b>e</b>) Diagonal distribution of the original image. (<b>f</b>) Diagonal distribution of the marked encrypted image.</p>
Full article ">
17 pages, 8510 KiB  
Article
Reversible Data Hiding in Encrypted Images Based on Preprocessing-Free Variable Threshold Secret Sharing
by Chao Jiang, Minqing Zhang, Xiong Zhang and Fuqiang Di
Appl. Sci. 2024, 14(13), 5574; https://doi.org/10.3390/app14135574 - 26 Jun 2024
Viewed by 999
Abstract
To solve the limitations of reversible data hiding in encrypted domains (RDH-ED) that cannot be applied to a distributed variable security environment, a novel RDH-ED scheme based on variable threshold image secret sharing (VTSIS) is proposed. Initially, a security vulnerability analysis of existing [...] Read more.
To solve the limitations of reversible data hiding in encrypted domains (RDH-ED) that cannot be applied to a distributed variable security environment, a novel RDH-ED scheme based on variable threshold image secret sharing (VTSIS) is proposed. Initially, a security vulnerability analysis of existing changing thresholds in a bivariate polynomial-based secret image sharing (TCSIS) method is conducted and validated through experiments. Subsequently, enhancements are made to the VTSIS scheme to rectify the identified security loopholes. During the image encryption process, additional data can be embedded into the redundancy of VTSIS, which results in a large embedding rate and high security. Finally, theoretical analysis and experimental proofs are carried out for the proposed scheme, and the results show that our scheme broadens the application scenarios of RDH-ED. Notably, the scheme eliminates the need for preprocessing and has the advantages of high security, a large embedding rate, and complete reversibility. Full article
(This article belongs to the Special Issue Recent Advances in Multimedia Steganography and Watermarking)
Show Figures

Figure 1

Figure 1
<p>Test image and attack effect when <span class="html-italic">k</span> − 1 attackers are involved in reconstructing the images.</p>
Full article ">Figure 2
<p>The framework of the proposed scheme.</p>
Full article ">Figure 3
<p>The instance flowchart of secret sharing and data embedding.</p>
Full article ">Figure 4
<p>The instance flowchart of secret extraction and image reconstruction.</p>
Full article ">Figure 5
<p>The test images.</p>
Full article ">Figure 6
<p>The visual presentation of the proposed scheme.</p>
Full article ">Figure 7
<p>Histogram of Peppers ((<b>a</b>) original image, (<b>b</b>) the first share, (<b>c</b>) the reconstructed image at <span class="html-italic">T</span> = 2, (<b>d</b>) the reconstructed image at <span class="html-italic">T</span> = 3, (<b>e</b>) the reconstructed image at <span class="html-italic">T</span> = 4; (<b>f</b>–<b>j</b>) the corresponding plane histogram; (<b>k</b>–<b>o</b>) the corresponding scatter histogram; (<b>p</b>–<b>t</b>) the corresponding 3D histogram).</p>
Full article ">Figure 8
<p>Pixel correlation in the four directions of the first share.</p>
Full article ">Figure 9
<p>Pixel correlation in the four directions of the reconstructed image with only two shares when <span class="html-italic">T</span> = 3.</p>
Full article ">Figure 10
<p>Comparison of PSNR for different schemes [<a href="#B18-applsci-14-05574" class="html-bibr">18</a>,<a href="#B23-applsci-14-05574" class="html-bibr">23</a>,<a href="#B26-applsci-14-05574" class="html-bibr">26</a>,<a href="#B28-applsci-14-05574" class="html-bibr">28</a>,<a href="#B29-applsci-14-05574" class="html-bibr">29</a>,<a href="#B34-applsci-14-05574" class="html-bibr">34</a>].</p>
Full article ">Figure 11
<p>The error map of Peppers.</p>
Full article ">Figure 12
<p>Comparison of ER for different schemes [<a href="#B25-applsci-14-05574" class="html-bibr">25</a>,<a href="#B27-applsci-14-05574" class="html-bibr">27</a>,<a href="#B28-applsci-14-05574" class="html-bibr">28</a>,<a href="#B29-applsci-14-05574" class="html-bibr">29</a>,<a href="#B30-applsci-14-05574" class="html-bibr">30</a>,<a href="#B31-applsci-14-05574" class="html-bibr">31</a>,<a href="#B34-applsci-14-05574" class="html-bibr">34</a>].</p>
Full article ">
10 pages, 2493 KiB  
Article
Progressive Reconstruction on Region-Based Secret Image Sharing
by Yanxiao Liu, Qindong Sun, Zhihai Yang, Yongluan Zhou, Weihua Zhao and Dantong Shi
Electronics 2024, 13(8), 1529; https://doi.org/10.3390/electronics13081529 - 17 Apr 2024
Viewed by 1089
Abstract
(k,n) threshold progressive secret image sharing (PSIS) has become an important issue in recent years. In (k,n) PSIS, a secret image is encrypted into n shadows such that k to n shadows can gradually reconstruct [...] Read more.
(k,n) threshold progressive secret image sharing (PSIS) has become an important issue in recent years. In (k,n) PSIS, a secret image is encrypted into n shadows such that k to n shadows can gradually reconstruct the secret image. Since an image can usually be divided into different regions in such a way that each region includes information with different importance levels, region-based PSIS has also been proposed where the reconstruction of different regions requires different thresholds on the shadow numbers. In this work, we propose new region-based (k,n) PSIS that achieves a novel reconstruction model, where all regions possess the property of (k,n) threshold progressive reconstruction, but the same number of shadows recovers a lower proportion of information in regions with a higher importance level. This new reconstruction model can further complete the application of region-based PSIS, where each region has an equal minimum threshold for reconstruction, and the difference in importance levels between regions can be reflected in the proportion of the recovered image using the same number of shadows. A theoretical analysis proves the correctness of the proposed scheme, and the experimental results from four secret images also show the practicality and effectiveness of the proposed scheme. Full article
(This article belongs to the Special Issue Recent Advances and Applications of Network Security and Cryptography)
Show Figures

Figure 1

Figure 1
<p>Image reconstruction using previous <math display="inline"><semantics> <mrow> <mo>(</mo> <mn>3</mn> <mo>,</mo> <mn>6</mn> <mo>)</mo> </mrow> </semantics></math> PSIS scheme.</p>
Full article ">Figure 2
<p>Image reconstruction using proposed <math display="inline"><semantics> <mrow> <mo>(</mo> <mn>3</mn> <mo>,</mo> <mn>6</mn> <mo>)</mo> </mrow> </semantics></math> PSIS scheme.</p>
Full article ">Figure 3
<p>Image reconstruction using previous <math display="inline"><semantics> <mrow> <mo>(</mo> <mn>4</mn> <mo>,</mo> <mn>8</mn> <mo>)</mo> </mrow> </semantics></math> PSIS scheme.</p>
Full article ">Figure 4
<p>Image reconstruction using proposed <math display="inline"><semantics> <mrow> <mo>(</mo> <mn>4</mn> <mo>,</mo> <mn>8</mn> <mo>)</mo> </mrow> </semantics></math> PSIS scheme.</p>
Full article ">
21 pages, 7107 KiB  
Article
Data Hiding and Authentication Scheme for Medical Images Using Double POB
by Fang Ren, Xuan Shi, Enya Tang and Mengmeng Zeng
Appl. Sci. 2024, 14(6), 2664; https://doi.org/10.3390/app14062664 - 21 Mar 2024
Cited by 1 | Viewed by 1150
Abstract
To protect the security of medical images and to improve the embedding ability of data in encrypted medical images, this paper proposes a permutation ordered binary (POB) number system-based hiding and authentication scheme for medical images, which includes three parts: image preprocessing, double [...] Read more.
To protect the security of medical images and to improve the embedding ability of data in encrypted medical images, this paper proposes a permutation ordered binary (POB) number system-based hiding and authentication scheme for medical images, which includes three parts: image preprocessing, double hiding, and information extraction and lossless recovery. In the image preprocessing and double hiding phase, firstly, the region of significance (ROS) of the original medical image is segmented into a region of interest (ROI) and a region of non-interest (RONI). Then, the bit plane of the ROI and RONI are separated and cross-reorganization to obtain two new Share images. After the two new Share images are compressed, the images are encrypted to generate two encrypted shares. Finally, the embedding of secret data and attaching of authentication bits in each of these two encrypted shares was performed using the POB algorithm. In the information extraction and lossless recovery phase, the POBN algorithm is first used to extract the authentication bits to realize image tamper detection; then, the embedded secret message is extracted, and the original medical image is recovered. The method proposed in this research performs better in data embedding and lossless recovery, as demonstrated by experiments. Full article
Show Figures

Figure 1

Figure 1
<p>The work of the image owner.</p>
Full article ">Figure 2
<p>The process of image segmentation and bit plane separation reorganization.</p>
Full article ">Figure 3
<p>Processes of data compression and data filling.</p>
Full article ">Figure 4
<p>Double embedding based on the POB system. (<b>a</b>) Secret message embedding based on the POB system. (<b>b</b>) Authentication information embedding based on the POB system.</p>
Full article ">Figure 5
<p>Process flow chart of extracting secret information and image recovery.</p>
Full article ">Figure 6
<p>The process of data reorganization and region recovery.</p>
Full article ">Figure 7
<p>The standard medical images used for testing. (<b>a</b>) Brain 01 MRI (512 × 512); (<b>b</b>) Brain 02 MRI (512 × 512); (<b>c</b>) Pulmonary 01 CT (256 × 256); (<b>d</b>) Pulmonary 02 DICOM (256 × 256); (<b>e</b>) Pancreas MRI (180 × 180); (<b>f</b>) Chest CT (256 × 256); (<b>g</b>) Knee X-ray (300 × 162); (<b>h</b>) Hand X-ray (64 × 64); (<b>i</b>–<b>p</b>) The ROS region of extracted. (<b>i</b>) Brain 01 (352 × 352); (<b>j</b>) Brain 02 (464 × 464); (<b>k</b>) Pulmonary 01 (176 × 176); (<b>l</b>) Pulmonary 02 (176 × 176); (<b>m</b>) Pancreas (120 × 120); (<b>n</b>) Chest (228 × 188); (<b>o</b>) Knee (212 × 162); (<b>p</b>) Hand X-ray (46 × 60).</p>
Full article ">Figure 8
<p>The gray histograms of the original and encrypted images. (<b>a</b>) Brain 01; (<b>b</b>) Brain 02; (<b>c</b>) Pulmonary 01; (<b>d</b>) Pulmonary 02.</p>
Full article ">Figure 8 Cont.
<p>The gray histograms of the original and encrypted images. (<b>a</b>) Brain 01; (<b>b</b>) Brain 02; (<b>c</b>) Pulmonary 01; (<b>d</b>) Pulmonary 02.</p>
Full article ">Figure 9
<p>The correlation comparison of the original and re-encrypted image. (<b>a</b>) Brain 01; (<b>b</b>) Brain 02; (<b>c</b>) Pulmonary 01; (<b>d</b>) Pulmonary 02.</p>
Full article ">Figure 9 Cont.
<p>The correlation comparison of the original and re-encrypted image. (<b>a</b>) Brain 01; (<b>b</b>) Brain 02; (<b>c</b>) Pulmonary 01; (<b>d</b>) Pulmonary 02.</p>
Full article ">Figure 10
<p>Comparison of ER between our scheme and related schemes [<a href="#B5-applsci-14-02664" class="html-bibr">5</a>,<a href="#B6-applsci-14-02664" class="html-bibr">6</a>,<a href="#B7-applsci-14-02664" class="html-bibr">7</a>,<a href="#B8-applsci-14-02664" class="html-bibr">8</a>,<a href="#B9-applsci-14-02664" class="html-bibr">9</a>] in ordinary images.</p>
Full article ">Figure 11
<p>Results of attack test. (<b>a</b>–<b>c</b>) ShareA<math display="inline"><semantics> <mrow> <mi mathvariant="normal">”</mi> </mrow> </semantics></math>; (<b>d</b>–<b>f</b>) the attacks of content cropping, text addition, and content exchange carried out on ShareA<math display="inline"><semantics> <mrow> <mi mathvariant="normal">”</mi> </mrow> </semantics></math>; (<b>g</b>–<b>i</b>) the recovered ShareA.</p>
Full article ">Figure 12
<p>The application scenario of the proposed scheme.</p>
Full article ">
19 pages, 1358 KiB  
Article
Advanced Dual Reversible Data Hiding: A Focus on Modification Direction and Enhanced Least Significant Bit (LSB) Approaches
by Cheonshik Kim, Luis Cavazos Quero, Ki-Hyun Jung and Lu Leng
Appl. Sci. 2024, 14(6), 2437; https://doi.org/10.3390/app14062437 - 14 Mar 2024
Cited by 3 | Viewed by 942
Abstract
In this study, we investigate advances in reversible data hiding (RDH), a critical area in the era of widespread digital data sharing. Recognizing the inherent vulnerabilities such as unauthorized access and data corruption during data transmission, we introduce an innovative dual approach to [...] Read more.
In this study, we investigate advances in reversible data hiding (RDH), a critical area in the era of widespread digital data sharing. Recognizing the inherent vulnerabilities such as unauthorized access and data corruption during data transmission, we introduce an innovative dual approach to RDH. We use the EMD (Exploiting Modification Direction) method along with an optimized LSB (Least Significant Bit) replacement strategy. This dual method, applied to grayscale images, has been carefully developed to improve data hiding by focusing on modifying pixel pairs. Our approach sets new standards for achieving a balance between high data embedding rates and the integrity of visual quality. The EMD method ensures that each secret digit in a 5-ary notational system is hidden by 2 cover pixels. Meanwhile, our LSB strategy finely adjusts the pixels selected by EMD to minimize data errors. Despite its simplicity, this approach has been proven to outperform existing technologies. It offers a high embedding rate (ER) while maintaining the high visual quality of the stego images. Moreover, it significantly improves data hiding capacity. This enables the full recovery of the original image without increasing file size or adding unnecessary data, marking a significant breakthrough in data security. Full article
(This article belongs to the Special Issue Deep Learning for Data Analysis)
Show Figures

Figure 1

Figure 1
<p>Schematic diagram of LSB matching revisited method [<a href="#B10-applsci-14-02437" class="html-bibr">10</a>,<a href="#B14-applsci-14-02437" class="html-bibr">14</a>].</p>
Full article ">Figure 2
<p>Schematic diagram of reversible modified LSB matching revisited method.</p>
Full article ">Figure 3
<p>Schematic diagram for the proposed model.</p>
Full article ">Figure 4
<p>Test grayscale images (512 × 512): (<b>a</b>) Baboon, (<b>b</b>) Barbara, (<b>c</b>) Boat, (<b>d</b>) Goldhill, (<b>e</b>) Airplane, (<b>f</b>) Lena, (<b>g</b>) Peppers, (<b>h</b>) Tiffany, and (<b>i</b>) Zelda.</p>
Full article ">Figure 5
<p>Comparative PSNR of SI<sub>1</sub> with different ERs for Lena image in different schemes [<a href="#B14-applsci-14-02437" class="html-bibr">14</a>,<a href="#B22-applsci-14-02437" class="html-bibr">22</a>,<a href="#B23-applsci-14-02437" class="html-bibr">23</a>].</p>
Full article ">Figure 6
<p>Comparative PSNR of SI<sub>2</sub> with different ERs for Lena image in different schemes [<a href="#B14-applsci-14-02437" class="html-bibr">14</a>,<a href="#B22-applsci-14-02437" class="html-bibr">22</a>,<a href="#B23-applsci-14-02437" class="html-bibr">23</a>].</p>
Full article ">Figure 7
<p>Comparison of histograms of the original Lena image and the two marked images.</p>
Full article ">Figure 8
<p>The RS analysis for two stego images, <math display="inline"><semantics> <mrow> <mi mathvariant="sans-serif">Δ</mi> <msub> <mi>I</mi> <mn>1</mn> </msub> </mrow> </semantics></math> and <math display="inline"><semantics> <mrow> <mi mathvariant="sans-serif">Δ</mi> <msub> <mi>I</mi> <mn>2</mn> </msub> </mrow> </semantics></math>, of Lena.</p>
Full article ">
11 pages, 4976 KiB  
Article
Image Division Using Threshold Schemes with Privileges
by Marek R. Ogiela and Lidia Ogiela
Electronics 2024, 13(5), 931; https://doi.org/10.3390/electronics13050931 - 29 Feb 2024
Viewed by 700
Abstract
Threshold schemes are used among cryptographic techniques for splitting visual data. Such methods allow the generation of a number of secret shares, a certain number of which need to be assembled in order to reconstruct the original image. Traditional techniques for partitioning secret [...] Read more.
Threshold schemes are used among cryptographic techniques for splitting visual data. Such methods allow the generation of a number of secret shares, a certain number of which need to be assembled in order to reconstruct the original image. Traditional techniques for partitioning secret information generate equal shares, i.e., each share has the same value when reconstructing the original secret. However, it turns out that it is possible to develop and use partitioning protocols that allow the generation of privileged shares, i.e., those that allow the reconstruction of secret data in even smaller numbers. This paper will therefore describe new information sharing protocols that create privileged shares, which will also use visual authorization codes based on subject knowledge to select privileged shares for secret restoration. For the protocols described, examples of their functioning will be presented, and their complexity and potential for use in practical applications will be determined. Full article
(This article belongs to the Special Issue Modern Computer Vision and Image Analysis)
Show Figures

Figure 1

Figure 1
<p>The process of medical image sharing and division along with the process of image restoration. Source: own development.</p>
Full article ">Figure 2
<p>The process of sharing an X-ray image of a hand bone with visible sarcoidosis. Source: own development.</p>
Full article ">Figure 3
<p>Failure to restore shared X-ray image of a hand bone. Source: own development.</p>
Full article ">Figure 4
<p>The process of reconstructing a shared X-ray image of a hand bone with different perceptual thresholds. Source: own development.</p>
Full article ">Figure 5
<p>The process of splitting and reconstructing a shared X-ray image of a hand bone with a selected perceptual threshold. Source: own development.</p>
Full article ">
27 pages, 3690 KiB  
Article
RG-Based Region Incrementing Visual Cryptography with Abilities of OR and XOR Decryption
by Yu-Ru Lin and Justie Su-Tzu Juan
Symmetry 2024, 16(2), 153; https://doi.org/10.3390/sym16020153 - 28 Jan 2024
Cited by 1 | Viewed by 1081
Abstract
Visual cryptography (VC) is a cryptographic technique that allows the encryption of a secret image into multiple shares. When the shares of a qualified subset are superimposed, the original secret image can be visually recovered. Region incremental visual cryptography (RIVC) is a class [...] Read more.
Visual cryptography (VC) is a cryptographic technique that allows the encryption of a secret image into multiple shares. When the shares of a qualified subset are superimposed, the original secret image can be visually recovered. Region incremental visual cryptography (RIVC) is a class of visual cryptography; it encrypts a single image into a shared image with multiple levels of secrecy, and when decrypted, the secret image of each region can be gradually recovered. Traditional VC encrypts two black-and-white images, and its recovery method is equivalent to a logical OR operation. To obtain a better recognizability of the restored image, the XORoperator becomes a simple and efficient method of encryption and decryption. Because the XOR operation needs extra cost or equipment, if the equipment cannot be obtained, the scheme can be more flexible if the secret can still be restored by using OR decryption (superimpose). In this paper, we propose a novel RIVC that allows encoding multiple secret regions of a secret image into n random grids. Both the OR operation and the XOR operation can be used as operations during decryption. The proposed scheme is evaluated by simulation, and the experimental result shows its correctness, effectiveness and practicability. Full article
(This article belongs to the Special Issue Symmetry and Asymmetry in Information Security and Network Security)
Show Figures

Figure 1

Figure 1
<p>The structure of OR (⊗) and XOR (⊕) decryption.</p>
Full article ">Figure 2
<p>Examples of different average light transmission (<span class="html-italic">T</span>) (<b>a</b>) Average light transmission is 0. (<b>b</b>) Average light transmission is 1. (<b>c</b>) Average light transmission is 0.5</p>
Full article ">Figure 3
<p>Examples of different contrast (<span class="html-italic">α</span>) (<b>a</b>) Secret image <span class="html-italic">S</span>. (<b>b</b>) <span class="html-italic">R</span> with <span class="html-italic">α</span> = <math display="inline"><semantics> <mrow> <mo>−</mo> <mn>1</mn> </mrow> </semantics></math>. (<b>c</b>) <span class="html-italic">R</span> with <span class="html-italic">α</span> = 0. (<b>d</b>) <span class="html-italic">R</span> with <span class="html-italic">α</span> = 0.2. (<b>e</b>) <span class="html-italic">R</span> with <span class="html-italic">α</span> = 0.4. (<b>f</b>) <span class="html-italic">R</span> with <span class="html-italic">α</span> = 0.6. (<b>g</b>) <span class="html-italic">R</span> with <span class="html-italic">α</span> = 0.8. (<b>h</b>) <span class="html-italic">R</span> with <span class="html-italic">α</span> = 1.</p>
Full article ">Figure 3 Cont.
<p>Examples of different contrast (<span class="html-italic">α</span>) (<b>a</b>) Secret image <span class="html-italic">S</span>. (<b>b</b>) <span class="html-italic">R</span> with <span class="html-italic">α</span> = <math display="inline"><semantics> <mrow> <mo>−</mo> <mn>1</mn> </mrow> </semantics></math>. (<b>c</b>) <span class="html-italic">R</span> with <span class="html-italic">α</span> = 0. (<b>d</b>) <span class="html-italic">R</span> with <span class="html-italic">α</span> = 0.2. (<b>e</b>) <span class="html-italic">R</span> with <span class="html-italic">α</span> = 0.4. (<b>f</b>) <span class="html-italic">R</span> with <span class="html-italic">α</span> = 0.6. (<b>g</b>) <span class="html-italic">R</span> with <span class="html-italic">α</span> = 0.8. (<b>h</b>) <span class="html-italic">R</span> with <span class="html-italic">α</span> = 1.</p>
Full article ">Figure 4
<p>The flowchart of (<span class="html-italic">k</span>, <span class="html-italic">n</span>) RG-VCS.</p>
Full article ">Figure 5
<p>Example of different secret levels (<span class="html-italic">Sl</span>). (<b>a</b>) <span class="html-italic">S</span><sub>1</sub>. (<b>b</b>) <span class="html-italic">Sl</span><sub>1</sub> for <span class="html-italic">S</span><sub>1</sub>. (<b>c</b>) <span class="html-italic">Sl</span><sub>2</sub> for <span class="html-italic">S</span><sub>1</sub>. (<b>d</b>) <span class="html-italic">Sl</span><sub>3</sub> for <span class="html-italic">S</span><sub>1</sub>. (<b>e</b>) <span class="html-italic">S</span><sub>2</sub>. (<b>f</b>) <span class="html-italic">Sl</span><sub>1</sub> for <span class="html-italic">S</span><sub>2</sub>. (<b>g</b>) <span class="html-italic">Sl</span><sub>2</sub> for <span class="html-italic">S</span><sub>2</sub>. (<b>h</b>) <span class="html-italic">Sl</span><sub>3</sub> for <span class="html-italic">S</span><sub>2</sub>. (<b>i</b>) <span class="html-italic">Sl</span><sub>4</sub> for <span class="html-italic">S</span><sub>2</sub>.</p>
Full article ">Figure 6
<p>Schematic diagram of Algorithm 3 (<span class="html-italic">k</span>, <span class="html-italic">n</span>) 2D_VCS.</p>
Full article ">Figure 7
<p>Schematic diagram of Algorithm 4 (<span class="html-italic">k</span>, <span class="html-italic">n</span>) 2D_RIVCS.</p>
Full article ">Figure 8
<p>The experimental results of the proposed (2, 3) 2D_RIVCS with two secret levels. (<b>a</b>) <span class="html-italic">S.</span> (<b>b</b>) <span class="html-italic">Sl</span><sub>1</sub>. (<b>c</b>) <span class="html-italic">Sl</span><sub>2</sub>. (<b>d</b>) <span class="html-italic">B</span><sub>1</sub>. (<b>e</b>) <span class="html-italic">B</span><sub>2</sub>. (<b>f</b>) <span class="html-italic">B</span><sub>3</sub>. (<b>g</b>) <span class="html-italic">B</span><sub>1</sub>⊗ <span class="html-italic">B</span><sub>2</sub>. (<b>h</b>) <span class="html-italic">B</span><sub>1</sub>⊗ <span class="html-italic">B</span><sub>2</sub>⊗ <span class="html-italic">B</span><sub>3</sub>. (<b>i</b>) <span class="html-italic">B</span><sub>1</sub>⊕ <span class="html-italic">B</span><sub>2</sub>. (<b>j</b>) <span class="html-italic">B</span><sub>1</sub>⊕ <span class="html-italic">B</span><sub>2</sub>⊕ <span class="html-italic">B</span><sub>3</sub>.</p>
Full article ">Figure 9
<p>The experimental results of the proposed (2, 3) 2D_RIVCS with two secret levels. (<b>a</b>) <span class="html-italic">S.</span> (<b>b</b>) <span class="html-italic">Sl</span><sub>1</sub>. (<b>c</b>) <span class="html-italic">Sl</span><sub>2</sub>. (<b>d</b>) <span class="html-italic">B</span><sub>1</sub>. (<b>e</b>) <span class="html-italic">B</span><sub>2</sub>. (<b>f</b>) <span class="html-italic">B</span><sub>3</sub>. (<b>g</b>) <span class="html-italic">B</span><sub>1</sub>⊗ <span class="html-italic">B</span><sub>2</sub>. (<b>h</b>) <span class="html-italic">B</span><sub>1</sub>⊗ <span class="html-italic">B</span><sub>2</sub>⊗ <span class="html-italic">B</span><sub>3</sub>. (<b>i</b>) <span class="html-italic">B</span><sub>1</sub>⊕ <span class="html-italic">B</span><sub>2</sub>. (<b>j</b>) <span class="html-italic">B</span><sub>1</sub>⊕ <span class="html-italic">B</span><sub>2</sub>⊕ <span class="html-italic">B</span><sub>3</sub>.</p>
Full article ">Figure 9 Cont.
<p>The experimental results of the proposed (2, 3) 2D_RIVCS with two secret levels. (<b>a</b>) <span class="html-italic">S.</span> (<b>b</b>) <span class="html-italic">Sl</span><sub>1</sub>. (<b>c</b>) <span class="html-italic">Sl</span><sub>2</sub>. (<b>d</b>) <span class="html-italic">B</span><sub>1</sub>. (<b>e</b>) <span class="html-italic">B</span><sub>2</sub>. (<b>f</b>) <span class="html-italic">B</span><sub>3</sub>. (<b>g</b>) <span class="html-italic">B</span><sub>1</sub>⊗ <span class="html-italic">B</span><sub>2</sub>. (<b>h</b>) <span class="html-italic">B</span><sub>1</sub>⊗ <span class="html-italic">B</span><sub>2</sub>⊗ <span class="html-italic">B</span><sub>3</sub>. (<b>i</b>) <span class="html-italic">B</span><sub>1</sub>⊕ <span class="html-italic">B</span><sub>2</sub>. (<b>j</b>) <span class="html-italic">B</span><sub>1</sub>⊕ <span class="html-italic">B</span><sub>2</sub>⊕ <span class="html-italic">B</span><sub>3</sub>.</p>
Full article ">Figure 10
<p>The experimental results of the proposed (2, 4) 2D_RIVCS with three secret levels. (<b>a</b>) <span class="html-italic">S</span>. (<b>b</b>) <span class="html-italic">Sl</span><sub>1</sub>. (<b>c</b>) <span class="html-italic">Sl</span><sub>2</sub>. (<b>d</b>) <span class="html-italic">Sl</span><sub>3</sub>. (<b>e</b>) <span class="html-italic">B</span><sub>1</sub>. (<b>f</b>) <span class="html-italic">B</span><sub>2</sub>. (<b>g</b>) <span class="html-italic">B</span><sub>3</sub>. (<b>h</b>) <span class="html-italic">B</span><sub>4</sub>. (<b>i</b>) <span class="html-italic">B</span><sub>1</sub>⊗ <span class="html-italic">B</span><sub>2</sub>. (<b>j</b>) <span class="html-italic">B</span><sub>1</sub>⊗ <span class="html-italic">B</span><sub>2</sub>⊗ <span class="html-italic">B</span><sub>3</sub>. (<b>k</b>) <span class="html-italic">B</span><sub>1</sub>⊗ <span class="html-italic">B</span><sub>2</sub>⊗<span class="html-italic">B</span><sub>3</sub>⊗<span class="html-italic">B</span><sub>4</sub>. (<b>l</b>) <span class="html-italic">B</span><sub>1</sub>⊕ <span class="html-italic">B</span><sub>2</sub>. (<b>m</b>) <span class="html-italic">B</span><sub>1</sub>⊕ <span class="html-italic">B</span><sub>2</sub>⊕ <span class="html-italic">B</span><sub>3</sub>. (<b>n</b>) <span class="html-italic">B</span><sub>1</sub>⊕ <span class="html-italic">B</span><sub>2</sub>⊕ <span class="html-italic">B</span><sub>3</sub> ⊕ <span class="html-italic">B</span><sub>4</sub>.</p>
Full article ">Figure 10 Cont.
<p>The experimental results of the proposed (2, 4) 2D_RIVCS with three secret levels. (<b>a</b>) <span class="html-italic">S</span>. (<b>b</b>) <span class="html-italic">Sl</span><sub>1</sub>. (<b>c</b>) <span class="html-italic">Sl</span><sub>2</sub>. (<b>d</b>) <span class="html-italic">Sl</span><sub>3</sub>. (<b>e</b>) <span class="html-italic">B</span><sub>1</sub>. (<b>f</b>) <span class="html-italic">B</span><sub>2</sub>. (<b>g</b>) <span class="html-italic">B</span><sub>3</sub>. (<b>h</b>) <span class="html-italic">B</span><sub>4</sub>. (<b>i</b>) <span class="html-italic">B</span><sub>1</sub>⊗ <span class="html-italic">B</span><sub>2</sub>. (<b>j</b>) <span class="html-italic">B</span><sub>1</sub>⊗ <span class="html-italic">B</span><sub>2</sub>⊗ <span class="html-italic">B</span><sub>3</sub>. (<b>k</b>) <span class="html-italic">B</span><sub>1</sub>⊗ <span class="html-italic">B</span><sub>2</sub>⊗<span class="html-italic">B</span><sub>3</sub>⊗<span class="html-italic">B</span><sub>4</sub>. (<b>l</b>) <span class="html-italic">B</span><sub>1</sub>⊕ <span class="html-italic">B</span><sub>2</sub>. (<b>m</b>) <span class="html-italic">B</span><sub>1</sub>⊕ <span class="html-italic">B</span><sub>2</sub>⊕ <span class="html-italic">B</span><sub>3</sub>. (<b>n</b>) <span class="html-italic">B</span><sub>1</sub>⊕ <span class="html-italic">B</span><sub>2</sub>⊕ <span class="html-italic">B</span><sub>3</sub> ⊕ <span class="html-italic">B</span><sub>4</sub>.</p>
Full article ">
10 pages, 2704 KiB  
Proceeding Paper
Deep Learning-Based Coverless Image Steganography on Medical Images Shared via Cloud
by Ambika, Virupakshappa and Deepak S. Uplaonkar
Eng. Proc. 2023, 59(1), 176; https://doi.org/10.3390/engproc2023059176 - 18 Jan 2024
Cited by 3 | Viewed by 1564
Abstract
Coverless image steganography is an approach for creating images with intrinsic colour and texture information that contain hidden secret information. Recently, generative adversarial networks’ (GANs) deep learning transformers have been used to generate secret hidden images. Although it has been proven that this [...] Read more.
Coverless image steganography is an approach for creating images with intrinsic colour and texture information that contain hidden secret information. Recently, generative adversarial networks’ (GANs) deep learning transformers have been used to generate secret hidden images. Although it has been proven that this approach is resistant to steganalysis attacks, it modifies critical information in the images which makes the images not suitable for applications like disease diagnosis from medical images shared over cloud. The colour and textural modification introduced by GANs affects the feature vector which is extracted from certain image regions and used for disease diagnosis. To solve this problem, this work proposes an attention-guided GAN which transforms images only in certain regions and retains the originality of images in certain regions. Due to this, there is not much distortion to features and disease classification accuracy. Full article
(This article belongs to the Proceedings of Eng. Proc., 2023, RAiSE-2023)
Show Figures

Figure 1

Figure 1
<p>Architecture of GAN-based stenographic technique.</p>
Full article ">Figure 2
<p>Proposed Architecture.</p>
Full article ">Figure 3
<p>AVG-GAN encoder architecture.</p>
Full article ">Figure 4
<p>AVG-GAN decoder architecture.</p>
Full article ">Figure 5
<p>Comparison of embedding capacity.</p>
Full article ">Figure 6
<p>Reduction in embedding capacity.</p>
Full article ">Figure 7
<p>Comparison of MCC.</p>
Full article ">
15 pages, 4438 KiB  
Article
On the Design of Multi-Party Reversible Data Hiding over Ciphered Overexposed Images
by Bing Chen, Ranran Yang, Wanhan Fang, Xiuye Zhan and Jun Cai
Symmetry 2024, 16(1), 45; https://doi.org/10.3390/sym16010045 - 29 Dec 2023
Viewed by 1010
Abstract
Multi-party reversible data hiding over ciphered images (MRDH-CI) has high restorability since the image is split into multiple ciphered images by secret sharing. However, the MRDH-CI methods either fail to produce satisfied results, or only work well for conventional images. This paper introduces [...] Read more.
Multi-party reversible data hiding over ciphered images (MRDH-CI) has high restorability since the image is split into multiple ciphered images by secret sharing. However, the MRDH-CI methods either fail to produce satisfied results, or only work well for conventional images. This paper introduces a multi-party reversible data-hiding approach over ciphered overexposed images. First, the pixels of the overexposed images are decomposed into two parts, each of which can be used for secret sharing. Then, the decomposed overexposed images are converted into multiple ciphered overexposed images by using a modified secret sharing method, in which the differences of the ciphered overexposed images are retained. The symmetry of the difference retaining makes the secret data conceal within the ciphered overexposed images such that the marked ciphered overexposed images can be created. Finally, by collecting sufficient marked ciphered overexposed images, it is possible to symmetrically reconstruct the concealed data and primitive overexposed image. Experimental results illustrate that the presented method can efficiently deal with overexposed images while maintaining a low computational overhead. Full article
(This article belongs to the Special Issue Symmetry and Asymmetry in Information Security and Network Security)
Show Figures

Figure 1

Figure 1
<p>Four overexposed images used for the experiment. (<b>a</b>) 1851.pgm, (<b>b</b>) 1933.pgm, (<b>c</b>) 2025.pgm, and (<b>d</b>) 7343.pgm.</p>
Full article ">Figure 2
<p>The framework of the presented approach, in which there are three parties actively involved.</p>
Full article ">Figure 3
<p>Sketch of the key generation process, where the security level of the secure hash algorithm is 256 bits.</p>
Full article ">Figure 4
<p>An example of the difference retaining in a group.</p>
Full article ">Figure 5
<p>Validate the proposed approach employing (3,4) modified secret sharing. (<b>a</b>) The primitive overexposed image, (<b>b</b>) the first ciphered overexposed image, (<b>c</b>) the second ciphered overexposed image, (<b>d</b>) the third ciphered overexposed image, (<b>e</b>) the fourth ciphered overexposed image, (<b>f</b>) the first marked ciphered overexposed image, (<b>g</b>) the second marked ciphered overexposed image, (<b>h</b>) the third marked ciphered overexposed image, (<b>i</b>) the fourth marked ciphered overexposed image, (<b>j</b>) the reestablished overexposed image with (<b>f</b>–<b>h</b>), (<b>k</b>) the reestablished overexposed image with (<b>f</b>,<b>g</b>,<b>i</b>), (<b>l</b>) the reestablished overexposed image with (<b>f</b>,<b>h</b>,<b>i</b>), and (<b>m</b>) the reestablished overexposed image with (<b>g</b>–<b>i</b>).</p>
Full article ">Figure 6
<p>Imperceptibility of the presented approach. (<b>a</b>) Primitive overexposed image, (<b>b</b>) the scrambled overexposed image, (<b>c</b>) the ciphered overexposed image, (<b>d</b>) the marked ciphered overexposed image with an embedding rate of 0.2 bpp, and (<b>e</b>) the marked ciphered overexposed image with an embedding rate of 0.4 bpp.</p>
Full article ">Figure 7
<p>Histograms of the overexposed images for statistical security analysis. (<b>a</b>) Primitive overexposed image “1851.pgm”, (<b>b</b>–<b>d</b>) the three ciphered overexposed images of (<b>a</b>), (<b>e</b>–<b>g</b>) the three marked ciphered overexposed images with respect to (<b>b</b>–<b>d</b>), (<b>h</b>) primitive overexposed image “7343.pgm”, (<b>i</b>–<b>k</b>) the three ciphered overexposed images of (<b>h</b>), and (<b>l</b>–<b>m</b>) the three marked ciphered overexposed images with respect to (<b>i</b>–<b>k</b>).</p>
Full article ">Figure 8
<p>Effect of the parameter <span class="html-italic">d</span> changes on embedding capacity for different overexposed images. (<b>a</b>) 1851.pgm, (<b>b</b>) 1933.pgm, (<b>c</b>) 2025.pgm, and (<b>d</b>) 7343.pgm.</p>
Full article ">
13 pages, 4835 KiB  
Article
A Matrix Coding-Oriented Reversible Data Hiding Scheme Using Dual Digital Images
by Jui-Chuan Liu, Ching-Chun Chang, Yijie Lin, Chin-Chen Chang and Ji-Hwei Horng
Mathematics 2024, 12(1), 86; https://doi.org/10.3390/math12010086 - 26 Dec 2023
Cited by 2 | Viewed by 1047
Abstract
With the development of Internet technology, information security and data protection have become particularly important. Reversible data hiding is an effective technique for data integrity and privacy protection, and secret image sharing is a distinct research field within reversible data hiding. Due to [...] Read more.
With the development of Internet technology, information security and data protection have become particularly important. Reversible data hiding is an effective technique for data integrity and privacy protection, and secret image sharing is a distinct research field within reversible data hiding. Due to the ability of sharing secret information between two receivers and the larger embedding capacity compared to the traditional reversible data hiding scheme, dual digital images have also attracted extensive research in the past decade. In this paper, we propose a reversible data hiding scheme based on matrix coding using dual digital images. By modifying the bits in the pixels, we can conceal three bits of the secret message in two pixels. In other words, the embedding rate reaches 1.5 bits per pixel (bpp). The experimental results demonstrate that our method has a significantly larger embedding capacity of 786,432 bits compared to previous similar methods while still maintaining acceptable image quality defined by a peak signal-to-noise ratio (PSNR) greater than 30 dB. The proposed scheme is suitable for applications required to pass a large amount of data but with minor security of image quality to be visually acceptable. Full article
(This article belongs to the Special Issue Data Hiding, Steganography and Its Application)
Show Figures

Figure 1

Figure 1
<p>Process of the proposed scheme.</p>
Full article ">Figure 2
<p>Examples of the proposed flow: (<b>a</b>) the odd pixel count, (<b>b</b>) the even pixel count.</p>
Full article ">Figure 3
<p>Examples for embedding, extraction, and recovery: (<b>a</b>) the odd pixel count, (<b>b</b>) the even pixel count.</p>
Full article ">Figure 4
<p>Eight 512 × 512 test images: (<b>a</b>) airplane, (<b>b</b>) baboon, (<b>c</b>) Barbara, (<b>d</b>) boat, (<b>e</b>) Goldhill, (<b>f</b>) lake, (<b>g</b>) Lena, (<b>h</b>) peppers.</p>
Full article ">Figure 5
<p>Shadow images of eight test images, with shadow 1 on the left and shadow 2 on the right: (<b>a</b>,<b>b</b>) airplane, (<b>c</b>,<b>d</b>) baboon, (<b>e</b>,<b>f</b>) Barbara, (<b>g</b>,<b>h</b>) boat, (<b>i</b>,<b>j</b>) Goldhill, (<b>k</b>,<b>l</b>) lake, (<b>m</b>,<b>n</b>) Lena, (<b>o</b>,<b>p</b>) peppers.</p>
Full article ">
Back to TopTop