On Compressing Encrypted Data without the Encryption Key

  • Mark Johnson
  • David Wagner
  • Kannan Ramchandran
Conference paper

DOI: 10.1007/978-3-540-24638-1_27

Part of the Lecture Notes in Computer Science book series (LNCS, volume 2951)
Cite this paper as:
Johnson M., Wagner D., Ramchandran K. (2004) On Compressing Encrypted Data without the Encryption Key. In: Naor M. (eds) Theory of Cryptography. TCC 2004. Lecture Notes in Computer Science, vol 2951. Springer, Berlin, Heidelberg

Abstract

When it is desired to transmit redundant data over an insecure and bandwidth-constrained channel, it is customary to first compress the redundant data and then encrypt it for security reasons. In this paper, we investigate the novelty of reversing the order of these steps, i.e. first encrypting and then compressing. Although counter-intuitive, we show surprisingly that through the use of coding with side information principles, this reversal in order is indeed possible. In fact, for lossless compression, we show that the theoretical compression gain is unchanged by performing encryption before compression. We show that the cryptographic security of the reversed system is directly related to the strength of the key generator.

Download to read the full conference paper text

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Mark Johnson
    • 1
  • David Wagner
    • 1
  • Kannan Ramchandran
    • 1
  1. 1.Department of Electrical Engineering and Computer SciencesUniversity of CaliforniaBerkeleyUSA

Personalised recommendations