Search for Articles:
Title / Keyword
Author / Affiliation / Email
Journal
Article Type
 
 
Advanced Search
 
Section
Special Issue
Volume
Issue
Number
Page
 

Saved Queries

Sign in to use this feature.

Search Filter Reset All

Years

Between: -

Subjects

remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
Add Subjects Reset
Select Subjects

Journals

remove_circle_outline
remove_circle_outline
remove_circle_outline
Add Journals Reset
Select Journals

Article Types

remove_circle_outline
Add Article Types Reset
Select Article Types

Countries / Regions

remove_circle_outline
remove_circle_outline
Add Countries / Regions Reset
Select Countries / Regions
Update Search
share announcement

Search Results (5)

Search Parameters:
Keywords = RDH-ED

Order results
Result details
Results per page
Show export options expand_more Show export options expand_less
Select all
Export citation of selected articles as:
20 pages, 22124 KiB  
Article
A Reversible Data-Hiding Method for Encrypted Images Based on Adaptive Quadtree Partitioning and MSB Prediction
by Ya Yue, Minqing Zhang, Fuqiang Di and Peizheng Lai
Appl. Sci. 2024, 14(14), 6376; https://doi.org/10.3390/app14146376 - 22 Jul 2024
Viewed by 504
Abstract
To address the vulnerability of the widely used block permutation and co-XOR (BPCX) encryption algorithm in reversible data-hiding in the encrypted domain (RDH-ED), which is susceptible to known-plaintext attacks (KPAs), and to enhance embedding capacity, we propose a novel technique of reversible data-hiding [...] Read more.
To address the vulnerability of the widely used block permutation and co-XOR (BPCX) encryption algorithm in reversible data-hiding in the encrypted domain (RDH-ED), which is susceptible to known-plaintext attacks (KPAs), and to enhance embedding capacity, we propose a novel technique of reversible data-hiding in encrypted images (RDH-EI). This method incorporates adaptive quadtree partitioning and most significant bit (MSB) prediction. To counteract KPAs, we introduce pixel modulation specifically targeting pixels within blocks of the same level during the encryption phase. During data embedding, we utilize tagging bits to indicate the state of the pixel blocks, capitalizing on pixel redundancy within those blocks to augment embedding capacity. Our experimental results demonstrate that our method not only achieves reversibility and separability but also significantly boosts embedding capacity and method security. Notably, the average embedding rate across the 10,000 images tested stands at 2.4731, surpassing previous methods by 0.2106 and 0.037, respectively. Full article
(This article belongs to the Section Computing and Artificial Intelligence)
►▼ Show Figures

Figure 1

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 463
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

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 736
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

29 pages, 9305 KiB  
Article
Complete Separable Reversible Data Hiding for Encrypted Digital Images Using Code Division Multiplexing with Versatile Bit Depth Management
by David Mata-Mendoza, Diana Nuñez-Ramirez, Manuel Cedillo-Hernandez, Mariko Nakano-Miyatake and Hector Perez-Meana
Mathematics 2023, 11(4), 1017; https://doi.org/10.3390/math11041017 - 16 Feb 2023
Cited by 3 | Viewed by 1423
Abstract
A reversible data hiding in the encrypted domain (RDH-ED) aims to hide data within encrypted images, protecting its content, while allowing additional information to be distributed. This paper presents a complete separable RDH-ED scheme, whose main contribution is allowing the receiver to extract [...] Read more.
A reversible data hiding in the encrypted domain (RDH-ED) aims to hide data within encrypted images, protecting its content, while allowing additional information to be distributed. This paper presents a complete separable RDH-ED scheme, whose main contribution is allowing the receiver to extract data and restore the image, either from the cryptogram with hidden data or from the directly decrypted version. With versatile bit-depth management, the most significant bits of each pixel are encrypted with AES-CTR cipher algorithm, while the additional data will be inserted inside the least significant bit planes of the encrypted pixels, by means of the code division multiplexing technique. Considering the marked/encrypted images, and encryption/data-hiding keys, a receiver could: (a) directly decrypt the encrypted image and obtain its approximate version, (b) extract the error-free hidden data, and (c) recover the data and original image. Considering an image approximation version and the data hiding key, a receiver could: (d) extract the hidden data from the plaintext domain, and (e) restore the image to its original state, while accessing the hidden data without any loss. Experimental results show the performance of the developed algorithm, evaluating the capacity and imperceptibility of the proposed scheme with respect to current state of the art. Full article
(This article belongs to the Special Issue Mathematical Methods for Computer Science)
►▼ Show Figures

Figure 1

15 pages, 2646 KiB  
Article
A Novel Reversible Data Hiding Method for 3D Model in Homomorphic Encryption Domain
by Ting Luo, Li Li, Shanqin Zhang, Shenxian Wang and Wei Gu
Symmetry 2021, 13(6), 1090; https://doi.org/10.3390/sym13061090 - 19 Jun 2021
Cited by 4 | Viewed by 1957
Abstract
Reversible data hiding in the encrypted domain (RDH-ED) is a technique that protects the privacy of multimedia in the cloud service. In order to manage three-dimensional (3D) models, a novel RDH-ED based on prediction error expansion (PEE) is proposed. First, the homomorphic Paillier [...] Read more.
Reversible data hiding in the encrypted domain (RDH-ED) is a technique that protects the privacy of multimedia in the cloud service. In order to manage three-dimensional (3D) models, a novel RDH-ED based on prediction error expansion (PEE) is proposed. First, the homomorphic Paillier cryptosystem is utilized to encrypt the 3D model for transmission to the cloud. In the data hiding, a greedy algorithm is employed to classify vertices of 3D models into reference and embedded sets in order to increase the embedding capacity. The prediction value of the embedded vertex is computed by using the reference vertex, and then the module length of the prediction error is expanded to embed data. In the receiving side, the data extraction is symmetric to the data embedding, and the range of the module length is compared to extract the secret data. Meanwhile, the original 3D model can be recovered with the help of the reference vertex. The experimental results show that the proposed method can achieve greater embedding capacity compared with the existing RDH-ED methods. Full article
(This article belongs to the Section Computer)
►▼ Show Figures

Figure 1

Show export options expand_more Show export options expand_less
Select all
Export citation of selected articles as:
 
Displaying article 1-50 on page 1 of 1.
Back to TopTop