On the Performance of Secret Entropy Coding: A Perspective Beyond Security

Li, Shujun

doi:10.1007/978-3-642-24806-1_30

Cited by 2 publications

(1 citation statement)

References 30 publications

(32 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A value of our works is also in providing arguments to question the claims of [9], in which Huffman coding has been evaluated as being unsuitable to encryption aimed at format compliance and file size preservation.…”

Section: A Conceptual Contributionmentioning

confidence: 99%

Encrypting JPEG-compressed images by substituting Huffman code words

Parfieniuk¹

2022

Annals of Computer Science and Information Systems

View full text Add to dashboard Cite

This paper presents a method for encrypting JPEGcoded images that preserves both compression ratio and format of a bit stream. Such solutions allow for selectively hiding information: image contents can be encrypted, while in-file metadata remain readable. Our algorithm is a symmetric, polygram substitution cipher, as it replaces Huffman code words and rearranges value bits that describe the main results of the Discrete Cosine Transform (DCT) of a pixel block: the DC coefficient and the first non-zero AC coefficient. Both length and format of a file are preserved, because bits are modified under constraints on their numbers. Such encryption is a kind of post-processing of a compressed bit stream, and thus it can be built on the top of an existing JPEG codec, without accessing its internals. Compared to previous similar solutions, our approach better hides image contours, exchanging AC for DC energy. Our work also reveals some properties of Huffman code tables and bit streams related to the JPEG standard.

show abstract

Section: A Conceptual Contributionmentioning

confidence: 99%