Compression of Encrypted Visual Data
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.
- 4.Eskicioglu, A.: Quality measurement for monochrome compressed images in the past 25 years. In: Proceedings of the International Conference on Acoustics, Speech and Signal Processing, pp. 1907–1910 (2000)Google Scholar
- 6.Furht, B., Kirovski, D. (eds.): Multimedia Security Handbook. CRC Press, Boca Raton, Florida (2005)Google Scholar
- 7.Norcen, R., Uhl, A.: Encryption of wavelet-coded imagery using random permutations. In: Proceedings of the IEEE International Conference on Image Processing (ICIP 2004), Singapore, IEEE Signal Processing Society (October 2004)Google Scholar
- 9.Tosun, A.S., Feng, W.C.: On error preserving encryption algorithms for wireless video transmission. In: Proceedings of the ninth ACM Multimedia Conference 2001, pp. 302–307, Ottawa, Canada (October 2001)Google Scholar
- 10.Uhl, A., Pommer, A.: Image and Video Encryption. From Digital Rights Management to Secured Personal Communication. In: Advances in Information Security, vol. 15, Springer, Heidelberg (2005)Google Scholar
- 12.Zeng, W., Wen, J., Severa, M.: Fast self-synchronous content scrambling by spatially shuffling codewords of compressed bitstreams. In: Proceedings of the IEEE International Conference on Image Processing (ICIP 2002) (September 2002)Google Scholar