On Compression of Data Encrypted With Block Ciphers

DOI10.1109/TIT.2012.2210752MaRDI QIDQ2989724zbMATH OpenOpenAlexWikidataFDO

Authors Demijan Klinc, Carmit Hazay, Ashish Jagmohan, Hugo Krawczyk, Tal Rabin

Publication date 8 June 2017

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1009.1759

Mathematics Subject Classification ID

Cryptography (94A60)

Abstract: This paper investigates compression of data encrypted with block ciphers, such as the Advanced Encryption Standard (AES). It is shown that such data can be feasibly compressed without knowledge of the secret key. Block ciphers operating in various chaining modes are considered and it is shown how compression can be achieved without compromising security of the encryption scheme. Further, it is shown that there exists a fundamental limitation to the practical compressibility of block ciphers when no chaining is used between blocks. Some performance results for practical code constructions used to compress binary sources are presented.

Cited in

(7)

• How to compress encrypted data
• Compression Functions Using a Dedicated Blockcipher for Lightweight Hashing
• On Compressing Encrypted Data
• Compressible FHE with applications to PIR
• Increasing data security by data compression
• A fixed-length source coding theorem on quasi-probability space
• scientific article; zbMATH DE number 67079 (Why is no real title available?)

This page was built for publication: On Compression of Data Encrypted With Block Ciphers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2989724)