Survey on JPEG compatible joint image compression and encryption algorithms

Li, Peiya; Lo, Kwok-Tung

doi:10.1049/iet-spr.2019.0276

Cited by 30 publications

(17 citation statements)

References 98 publications

(252 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Knowing the code words, or coefficient values, one can determine (h 1 + h 0 ) and (v 1 + v 0 ) and decide whether substitution is possible. If so, then these bit counts point out the group of N >= 2 pairs of code words that can be exchanged for each other in accordance with (1). Let us assume that the members of the substitute group are ordered, so that they form an array and can be indexed by the numbers from 0 to (N − 1).…”

Section: B Encryption Proceduresmentioning

confidence: 99%

“…These words can be combined into 12 × 161 = 1932 DC-AC pairs, which can be grouped with respect to both the total length of Huffman code words and the total number of the value bits that must accompany them. If a resulting group comprises two or more pairs of code words, then these DC-AC pairs can be substituted for each other in accordance with (1).…”

Section: A Substitution Limitations By Huffman Code Tablesmentioning

confidence: 99%

“…I N RECENT years, one can notice research efforts to combine the JPEG standard for image coding with data encryption [1]. Format-preserving approaches to joint encryptioncompression are less efficient, more difficult to implement, and less secure than general-purpose ciphers.…”

Section: Introductionmentioning

confidence: 99%

“…OF DC-AND (AFTER "-") AC-RELATED DEFAULT CODE WORDS THAT CANNOT BE SUBSTITUTED IN ACCORDANCE WITH(1) …”

mentioning

confidence: 99%

See 3 more Smart Citations

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: B Encryption Proceduresmentioning

confidence: 99%

Section: A Substitution Limitations By Huffman Code Tablesmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

“…OF DC-AND (AFTER "-") AC-RELATED DEFAULT CODE WORDS THAT CANNOT BE SUBSTITUTED IN ACCORDANCE WITH(1) …”

mentioning

confidence: 99%

See 2 more Smart Citations

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

show abstract

“…Secret sharing (SS) [1][2][3] is an important tool in cryptography, which constructs many security protocols, such as secure multi-party computation [4], distributed key negotiation [5,6], threshold secret system [7,8] etc. Compared with traditional security methods such as encryption [9], SS has the characteristics of loss tolerance [10], which can solve the problem of loss and damage of encrypted carriers. Therefore, it has become a very important branch of cryptography.…”

Section: Introductionmentioning

confidence: 99%

Renewal of secret and shadows in secret image sharing

Yan

et al. 2022

IET Information Security

View full text Add to dashboard Cite

Secret image sharing (SIS) is an important method to protect the security of secret images. When part of the shadows generated by the secret sharing is leaked or when the secret image is restored, the shadows and the secret need to be renewed. Aiming at secret image and shadow image renewal, a scheme for renewing secret image and shadow images is proposed. The scheme is to multiply the original and renewed shadow of the corresponding serial number to get a new shadow over finite fields. Our scheme can realise the renewal of the secret image and shadows and has characteristics of the variable threshold, secure public transmission, variable size, and lossless recovery. This paper theoretically analyses and proves the security of the proposed scheme and verifies the effectiveness through a large number of experiments.

show abstract

On the Security of Encrypted JPEG Image with Adaptive Key Generated by Invariant Characteristic

Yuan

Fan

2022

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Survey on JPEG compatible joint image compression and encryption algorithms

Cited by 30 publications

References 98 publications

Encrypting JPEG-compressed images by substituting Huffman code words

Encrypting JPEG-compressed images by substituting Huffman code words

Renewal of secret and shadows in secret image sharing

On the Security of Encrypted JPEG Image with Adaptive Key Generated by Invariant Characteristic

Contact Info

Product

Resources

About