Joint compression and encryption of visual data using orthogonal parametric transforms

• Autorzy: Puchala D. , Yatsymirskyy M. M.

Identyfikatory

DOI

10.1515/bpasts-2016-0042

• Języki publikacji: EN

Abstrakty

EN

In this paper, we introduce a novel method of joint compression and encryption of visual data. In the proposed approach the compression stage is based on block quantization while the encryption uses fast parametric orthogonal transforms of arbitrary forms in combination with a novel scheme of intra-block mixing of data vectors. Theoretical analysis of the method indicates no impact of encryption stage on the effectiveness of block quantization with an additional step of first order entropy coding. Moreover, a series of experimental studies involving natural images and JPEG lossy compression standard were performed. Here, the obtained results indicate a high level of visual content concealment with only a small reduction of compression performance. An additional analysis of security allows to state that the proposed method is resistant to cryptanalytic attacks known for visual data encryption schemes including the most efficient NZCA attack. The proposed method can be also characterized by high computational efficiency and feasibility of hardware realizations.

Słowa kluczowe

EN

data encryption; parametric linear transforms; lossy data compression

PL

szyfrowanie danych; parametryczne transformacje liniowe; kompresja danych

• Wydawca: Polska Akademia Nauk, Wydział IV Nauk Technicznych
• Czasopismo: Bulletin of the Polish Academy of Sciences. Technical Sciences
• Rocznik: 2016
• Tom: Vol. 64, nr 2
• Strony: 373--382
• Opis fizyczny: Bibliogr. 39 poz., fot., rys., wykr.

Twórcy

autor

Puchala D.

• Lodz University of Technology, Institute of Information Technology, 215 Wolczanska St., Lodz, Poland

autor

Yatsymirskyy M. M.

• Lodz University of Technology, Institute of Information Technology, 215 Wolczanska St., Lodz, Poland

Bibliografia

• [1] J. Katz and Y. Lindell, “Introduction to Modern Cryptography: Principles and Protocols”, Chapman and Hall/CRC, (2007).
• [2] Y. Zhou, K. Panetta, and S. Agaian, “Image Encryption Using Discrete Parametric Cosine Transform”, Conf. Signals, Systems and Computers, 395‒399 (2009).
• [3] M.V. Malakooti and M.R.N. Dobuneh, “A Lossless Digital Encryption System for Multimedia Using Orthogonal Transforms”, 2nd Inter. Conf. Digital Information and Comm. Tech. and App. (DICTAP), 240‒244 (2012).
• [4] B. Bhargava, Ch. Shi, and Sh.Y. Wang, “MPEG Video Encryption Algorithms”, Multimedia Tools and App., 24 (1), 57‒79 (2004).
• [5] L. Tang, “Methods For Encrypting And Decrypting MPEG Video Data Efficiently”, ACM Multimedia, ACM Press, 219‒229 (1996).
• [6] D.R. Rao and P. Yip, “Discrete Cosine Transform”, San Diego, CA: Academic, (1990).
• [7] L. Qiao and K. Nahrstedt, ”Comparison of MPEG Encryption Algorithms”, Int. Journal on Computer and Graphics, 22 (3), (1998).
• [8] C. Kailasanathan and R.S. Naini, “Compression Performance of JPEG Encryption Scheme”, 14th Int. Conf. on Digital Signal Processing, 2, 1329‒1332 (2002).
• [9] R. Ridzo˘n, D. Levický, and T. Kanócz, “Information Hiding Within Still Images Based on the DCT Coefficients Flipping and Encryption”, 52nd Inter. Symposium ELMAR-2010, 147-150 (2010).
• [10] F. Wang and S. Bai, “JPEG Image Encryption By Shuffling DCT Coefficients In Defined Block”, Inter. Conf. on Computational and Information Sciences, 60‒63 (2013).
• [11] M.M. Fisch, H. Stögner, and A. Uhl, “Layered Encryption Techniques For DCT-Coded Visual Data”, 12th European Signal Processing Conference, 821‒824 (2004).
• [12] W. Puech and J.M. Rodrigues, “Crypto-Compression of Medical Images by Selective Encryption of DCT”, 13th European Signal Processing Conference, (2005).
• [13] M.I. Khan, V. Jeoti, and M.A. Khan, “Perceptual Encryption of JPEG Compressed Images Using DCT Coefficients and Splitting of DC Coefficients into Bitplanes”, Inter. Conference on Intelligent and Advanced Systems, 1‒6 (2010).
• [14] M.I. Khan, V. Jeoti, A.S. Malik, and M.F. Khan, “A Joint Watermarking And Encryption Scheme For DCT Based Codecs”, 17th Asia-Pacific Conf. on Communications, 816‒820 (2011).
• [15] Y. Liang, K. Guo, and J. Li, “An Improved Video Encryption Method Design”, 10th Inter. Computer Conference on Wavelet Active Media Technology and Information Processing, 95‒99 (2013).
• [16] C.N. Raju, K. Srinathan, and C.V. Jawahar, “A Real-Time Video Encryption Exploiting the Distribution of the DCT Coefficients”, IEEE Region 10 Conf. 2008, 1‒6 (2008).
• [17] H. Seddik and E.B. Braiek, “Image Securing Based Chaotic Encryption Coupled With DCT Robust Watermarking”, Inter. Conference on Electrical Engineering and Software Applications, 1‒6 (2013).
• [18] F. Ahmed, M.Y. Siyal, and V.U. Abbas, “A Perceptually Scalable and JPEG Compression Tolerant Image Encryption Scheme”, 4th Pacific-Rim Symposium on Image and Video Technology, 232‒238 (2010).
• [19] Y. Fengxia, “DCT Domain Color Image Block Encryption Algorithm based on Three-dimensional Arnold Mapping”, Inter. Conference on Computational and Information Sciences, 682-685 (2013).
• [20] D. Huffman, “A Method for the Construction of Minimum- Redundancy Codes”, Proceedings of the IRE 40(9), 1098‒1101 (1952).
• [21] S. Auer, A. Bliem, D. Engel, A. Uhl, and A. Unterweger, “Bitstream- based JPEG Encryption in Real-time”, Inter. Journal of Digital Crime and Forensics, 5 (3), 1‒14 (2013).
• [22] T.E. Seidel, D. Socek, and M. Šrámka, “Cryptoanalysis of Video Encryption Algorithms”, Tatra Mountains Mathematical Publications, 29, 79‒87 (2004).
• [23] W. Li and Y. Yuan, “A leak and its remedy in JPEG image encryption”, Inter. Journal of Computer Mathematics, 84(9), 1367‒1378 (2007).
• [24] S. Agaian, K. Tourshan, and J. P. Noonan, “Parametric Slant- Hadamard transforms with applications”, IEEE Signal Processing Letters, 9(11), 375‒377 (2002).
• [25] S. Minasyan, J. Astola, and D. Guevorkian, “On unified architectures for synthesizing and implementation of fast parametric transforms”, Proc. 5th Inter. Conference on Information, Communications and Signal Processing, 710‒714 (2005).
• [26] S. Bouguezel, M. O. Ahmad, and M. N. S. Swamy, “New parametric Fourier and Hartley transforms, and algorithms for fast computation”, IEEE Trans. Circuits Systems, 58(3), 562‒575 (2011).
• [27] M. Morháč and V. Matoušek, “Data compression using new fast adaptive cosine-Haar transforms”, Elsevier Digital Signal Processing Journal, 8(2), 63‒81 (1998).
• [28] B. Stasiak and M. Yatsymirskyy, “Fast Orthogonal Neural Networks”, Lecture Notes in Computer Science, Artificial Intelligence and Soft Computing ICAISC 2006, 4029, 142‒149 (2006).
• [29] D. Puchala and M. Yastymirskyy, “Fast parametrized biorthogonal transforms”, Electrical Review, 88(4a), 123‒125 (2012).
• [30] D. Puchala and M. Yastymirskyy, “Fast Parametrized Biorthogonal Transforms With Normalized Basis Vectors”, Electrical Review, 89(3a), 277‒279 (2013).
• [31] J. Stolarek, “Adaptive synthesis of a wavelet transform using fast neural network”, Bull. Pol. Ac.: Tech., 59, 9‒13 (2011).
• [32] P. Lipinski, “Robust digital watermarks in images. Adaptive selection of embedding domain”, Warsaw: EXIT, Academic Publishing House, (2013), (in Polish).
• [33] V.E. Beneš, “Mathematical Theory of Connecting Networks and Telephone Traffic”, Academic Press, (1965).
• [34] D. Puchala and K. Stokfiszewski, “Parametrized Orthogonal Transforms For Data Encryption”, Computational Problems of Electrical Engineering, 3 (1), (2013).
• [35] H.P. Kramer and M.V. Mathews, “A linear coding for transmitting a set of correlated signals”, IRE Transactions on Information Theory, IT-2, 41‒46 (1956).
• [36] R.M. Gray and D.L. Neuhoff, “Quantization”, IEEE Trans. Inform. Theory, 44(6), 2325‒2383 (1998).
• [37] J.J.Y. Huang and P.M. Schultheiss, “Block Quantization of Correlated Gaussian Random Variables”, IEEE Trans. On Communications Systems, 289‒296 (1963).
• [38] A. Papoulis, “Probability and statistics”, Prentice Hall, (1989).
• [39] M.M. Jacymirski and D. Puchala, “Fast Time-Decimated Algorithms of One-Dimensional Discrete Cosine and Sine Transforms of Type II and Type IV”, Modeling and Information Technologies, 27, 137‒148 (2004).

Uwagi

PL

Opracowanie ze środków MNiSW w ramach umowy 812/P-DUN/2016 na działalność upowszechniającą naukę.