2023
DOI: 10.1109/tcyb.2022.3163245
|View full text |Cite
|
Sign up to set email alerts
|

Lossless Data Hiding in Encrypted Images Compatible With Homomorphic Processing

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

1
15
0

Year Published

2023
2023
2024
2024

Publication Types

Select...
5
1
1

Relationship

1
6

Authors

Journals

citations
Cited by 11 publications
(16 citation statements)
references
References 46 publications
1
15
0
Order By: Relevance
“…Here formula for correlation coefficient r xy [69] (equation (7)) between the adjacent pixels in a certain direction is used as follows, original image is nearly diagonal which depicts that the adjacent pixel values are highly correlated and for the encrypted image, the scatter plot is uniformly distributed all over the frame which confirms that the correlation of the adjacent pixels is almost zero (table 8). A comparative analysis is done here for Lena image in 3 directions and three colour channels using the proposed algorithm in comparison with [24][25][26][27][28][29], [49]. This study validates the efficiency of the algorithm.…”
Section: Correlation Analysis Between Adjacent Pixelssupporting
confidence: 54%
See 1 more Smart Citation
“…Here formula for correlation coefficient r xy [69] (equation (7)) between the adjacent pixels in a certain direction is used as follows, original image is nearly diagonal which depicts that the adjacent pixel values are highly correlated and for the encrypted image, the scatter plot is uniformly distributed all over the frame which confirms that the correlation of the adjacent pixels is almost zero (table 8). A comparative analysis is done here for Lena image in 3 directions and three colour channels using the proposed algorithm in comparison with [24][25][26][27][28][29], [49]. This study validates the efficiency of the algorithm.…”
Section: Correlation Analysis Between Adjacent Pixelssupporting
confidence: 54%
“…With the rapid growth of the internet and IoT, for the necessity of efficient and secure transmission of data, researchers have proposed various methods including data hiding [26,27], digital watermarking [28,29], and image encryption [30,31]. The most effective way of securing the transmission of image infromation is the image encryption process [32][33][34].…”
Section: Introductionmentioning
confidence: 99%
“…Wu et al [27] developed a hierarchical embedding algorithm with Paillier encryption, which has a higher EC. Subsequently, several excellent schemes are designed [28,29]. However, another issue of encrypted data expansion is raised by public key encryption.…”
Section: In Terms Of Improving Embedding Capacitymentioning
confidence: 99%
“…Depending on the specific applications, the hidden data need to be retrieved before or after decrypting the ciphertext. For instance, a separable RDH scheme (e.g., [17], [25], [26], [27], [28]) indicates that data extraction can be performed without decryption, while decryption is required for data extraction with the inseparable algorithms (e.g., [22], [23], [39]).…”
Section: Introductionmentioning
confidence: 99%
“…For homomorphic encryption schemes, lossless data hiding in ciphertexts (LDH-CT) has been recently proposed to hide extra data without changing the file size or plaintext of a ciphertext (e.g., [30], [38], [39]). Hereinafter, a RDH method that maintains the plaintext unchanged after hiding data into a ciphertext is denoted as LDH-CT. As a countermeasure to the known plain-text attack, randomness is introduced in the encryption so that one plain-text value corresponds to multiple cipher values.…”
Section: Introductionmentioning
confidence: 99%