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. © IFIP International Federation for Information Processing 2006.
CITATION STYLE
Gschwandtner, M., Uhl, A., & Wild, P. (2006). Compression of encrypted visual data. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4237 LNCS, pp. 141–150). Springer Verlag. https://doi.org/10.1007/11909033_13
Mendeley helps you to discover research relevant for your work.