Partial encryption of compressed images and videos

Cheng, Howard; Li, Xiaobo

doi:10.1109/78.852023

Cited by 442 publications

(241 citation statements)

References 26 publications

Supporting

Mentioning

241

Contrasting

Order By: Relevance

“…The ÿrst attempts in this direction have been made to secure DCT-based multimedia representations (see e.g. [8][9][10][11][12][13][14][15][16][17]), wavelet based [18][19][20][21]17] and quadtree based representations [22,23] have been considered also. Recently, selective encryption schemes based on selective bitplane encryption [24], resistant to bit errors [25], and compliant to video formats [26] have been proposed for wireless environments.…”

Section: Selective Encryption Of Medical Image Datamentioning

confidence: 99%

Confidential storage and transmission of medical image data

Norcen

Podesser²,

Pommer

et al. 2003

Computers in Biology and Medicine

View full text Add to dashboard Cite

We discuss computationally e cient techniques for conÿdential storage and transmission of medical image data. Two types of partial encryption techniques based on AES are proposed. The ÿrst encrypts a subset of bitplanes of plain image data whereas the second encrypts parts of the JPEG2000 bitstream. We ÿnd that encrypting between 20% and 50% of the visual data is su cient to provide high conÿdentiality. ?

show abstract

Section: Selective Encryption Of Medical Image Datamentioning

confidence: 99%

Confidential storage and transmission of medical image data

Norcen

Podesser²,

Pommer

et al. 2003

Computers in Biology and Medicine

View full text Add to dashboard Cite

show abstract

“…Similar to HCM-PT [4], our proposed scheme HCM-PRE is secure against the KPCA since each plaintext is encrypted by a different key, and the number of such dynamic keys is significantly large (27).…”

Section: Known Plaintext-ciphertext Attackmentioning

confidence: 99%

“…Equations (4), (24), and (27) show that the NDK(HCM-PRE) (27) is larger than the NDK(HCM-PT) (4) and NDK(HCM-EE) (24); hence HCM-PRE is more secure.…”

Section: Known Plaintext-ciphertext Attackmentioning

confidence: 99%

“…Table 2 shows that HCM-PT is faster than HCM-EE but equations (4) and (24) show that NDK(HCM-EE) is greater than NDK(HCM-PT), hence HCM-EE is more secure than HCM-PT. Equation (27) shows that NDK(HCM-PRE) is greater than NDK(HCM-EE). Hence HCM-PRE is more secure and is more effective in the encryption time than HCM-PT, HCM-H, HCM-HMAC and HCM-EE.…”

Section: Rows 4-5)mentioning

confidence: 99%

“…To prove the robustness of the proposed scheme, the statistical analysis has been performed. It is usually evaluated by the following measures [21,23,27,28,29]; calculating the histograms of the encrypted images and the correlation of two adjacent pixels in the plain/encrypted image demonstrating their superior confusion and diffusion property. The obtained results show that our scheme strongly withstands statistical attacks.…”

Section: Statistical Analysis Resistancementioning

confidence: 99%

See 2 more Smart Citations

Hill Cipher Modification based on Pseudo-Random Eigenvalues

Mahmoud¹,

Chefranov²

2014

Appl. Math. Inf. Sci.

View full text Add to dashboard Cite

Abstract:The Hill cipher is resistant to brute-force and statistical attacks, but it can be broken with a known plaintext-ciphertext attack (KPCA). In this paper, we propose a modification of the Hill cipher, HCM-PRE, which is still resistant to brute-force and statistical attacks, and is resistant also to KPCA due to dynamic encryption key matrix generating. With the modification, the new HCM-PRE can be applied widely in the systems which need high security (e.g., image encryption). Experimental results show that the proposed modification is significantly more effective in the encryption quality of images than original Hill cipher and its known modifications (HCM-PT, HCM-H, HCM-HMAC, and HCM-EE) in the case of images with large single colour areas, and slightly more effective otherwise. HCM-PRE is about two times faster than HCM-EE and HCM-HMAC and four times faster than HCM-H in the frame of our experiments.

show abstract