Compression of encrypted visual data

  • Authors:
  • Michael Gschwandtner;Andreas Uhl;Peter Wild

  • Affiliations:
  • Department of Computer Sciences, Salzburg University, Austria;Department of Computer Sciences, Salzburg University, Austria;Department of Computer Sciences, Salzburg University, Austria

  • Venue:
  • CMS'06 Proceedings of the 10th IFIP TC-6 TC-11 international conference on Communications and Multimedia Security
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

Chaotic mixing based encryption schemes for visual data are shown to be robust to lossy compression as long as the security requirements are not too high. This property facilitates the application of these ciphers in scenarios where lossy compression is applied to encrypted material – which is impossible in case traditional ciphers should be employed. If high security is required chaotic mixing loses its robustness to compression, still the lower computational demand may be an argument in favor of chaotic mixing as compared to traditional ciphers when visual data is to be encrypted.