2020
DOI: 10.1016/j.sigpro.2020.107629
|View full text |Cite
|
Sign up to set email alerts
|

A robust meaningful image encryption scheme based on block compressive sensing and SVD embedding

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
71
0
1

Year Published

2020
2020
2024
2024

Publication Types

Select...
4
4
1

Relationship

1
8

Authors

Journals

citations
Cited by 118 publications
(72 citation statements)
references
References 51 publications
0
71
0
1
Order By: Relevance
“…Step 11: iterate equation (2) under system parameter p and initial condition t 0 . e revolving control sequence RS5 and the key sequence KS1 are generated by equations (32) and (33), respectively:…”
Section: Decryption Algorithmmentioning
confidence: 99%
See 1 more Smart Citation
“…Step 11: iterate equation (2) under system parameter p and initial condition t 0 . e revolving control sequence RS5 and the key sequence KS1 are generated by equations (32) and (33), respectively:…”
Section: Decryption Algorithmmentioning
confidence: 99%
“…Ye et al [31] proposed an image encryption scheme by using quaternion discrete fractional Hartley transform and an improved pixel adaptive diffusion. In [32], Zhu et al use block compressive sensing and singular value decomposition embedding to balance the security, compression, and robustness. In [33], an image encryption scheme is proposed by using 2D multiple parameter fractional discrete Fourier transform and 3D Arnold transform.…”
Section: Introductionmentioning
confidence: 99%
“…To prevent the image from being destroyed maliciously in the transmission process, the image encryption algorithm should have strong robustness, allowing the ciphertext image to be decrypted correctly following its attack by noise or cropping [56]. We use the ciphertext image obtained by the proposed algorithm for robustness analysis.…”
Section: K Robustness Analysismentioning
confidence: 99%
“…However, the large-scale Gaussian random measurement matrix used as the key in Huang's scheme requires additional storage space and transmission cost. Subsequently, in order to overcome this issue, key-controlled partial Hadamard matrix [18][19], partial random block weighing matrix [20], structurally random matrix [21] and chaosbased measurement matrix [22][23][24] are introduced to compress the plain image. Besides, in the encryption phase, the counter mode [25][26], hash function [23,27] and plaintext eigenvalue [28] are applied to withstand the plaintext attacks, since different plain images correspond to different key streams.…”
Section: Introductionmentioning
confidence: 99%