Image adaptive selective encryption of vector quantization index compression (original) (raw)
Related papers
arXiv (Cornell University), 2011
The popularity of Internet usage although increases exponentially, it is incapable of providing the security for exchange of confidential data between the users. As a result, several cryptosystems for encryption of data and images have been developed for secured transmission over Internet. In this work, a scheme for Image encryption/decryption based on Vector Quantization (VQ) has been proposed that concurrently encodes the images for compression and shuffles the codebook and the index matrix using pseudorandom sequences for encryption. The processing time of the proposed scheme is much less than the other cryptosystems, because it does not use any traditional cryptographic operations, and instead it performs swapping between the contents of the codebook with respect to a random sequence, which resulted an indirect shuffling of the contents of the index matrix. It may be noted that the security of the proposed cryptosystem depends on the generation and the exchange of the random sequences used. Since the generation of truly random sequences are not practically feasible, we simulate the proposed scheme using MATLAB, where its operators like rand(method, seed), randperm(n) has been used to generate pseudorandom sequences and it has been seen that the proposed cryptosystem shows the expected performance.
2016
Due to rich growth of multimedia application it becomes essential to secure and compress the multimedia data. Digital distribution network is a medium used to transfer the multimedia data. It is obvious to provide security against these multimedia data for unauthorized access or use. This is achieved by applying encryption. The encryption is a mathematical process which converts an original message into unintelligible message. There are a lot of encryption rules which can be applied to secure the simplest form of multimedia data (text data) and not suitable for images and videos having large files size. Selective encryption is a modern technique to lessen the computational requirements for large amount of multimedia data in distribution networks with diverse client device capabilities. In this paper, we have studied about principle and working of Selective Image Encryption.
Reversible Data Hiding for VQ-Compressed Images Basedon an Index Replacement Technique
International Journal of Computer and Electrical Engineering, 2012
In this paper a reversible data hiding scheme based on vector quantization (VQ) image compression technique is proposed. Reversibility property allows VQ compressed code to be completely recovered after extraction of the secret data. Positions in the sorted codebook are divided into some intervals. A mapping method is proposed to embed data. To each position with high hit rate in the sorted codebook, an interval of the positions is assigned. According to the secret bits each index which located in the positions with high hit rates of the sorted codebook is re-encoded by one of the indices in the interval which has been assigned to that position. Experimental results demonstrate that proposed scheme outperforms other existing schemes.
Partial Encryption of Compressed Image Using Threshold Quantization and AES Cipher
Iraqi Journal for Electrical And Electronic Engineering, 2012
Cryptography is one of the technological means to provide security to data being transmitted on information and communication systems. When it is necessary to securely transmit data in limited bandwidth, both compression and encryption must be performed. Researchers have combined compression and encryption together to reduce the overall processing time. In this paper, new partial encryption schemes are proposed to encrypt only part of the compressed image. Soft and hard threshold compression methods are used in the compression step and the Advanced Encryption Standard (AES) cipher is used for the encryption step. The effect of different threshold values on the performance of the proposed schemes are studied. The proposed partial encryption schemes are fast, secure, and do not reduce the compression performance of the underlying selected compression methods.
Joint Image Compression and Encryption Based on Compressed Sensing and Entropy Coding
IEEE 13th International Colloquium on Signal Processing and its Applications, 2017
In this paper, we propose a joint image compression and encryption technique based on Compressed Sensing (CS). Our work is based on JPEG standard. After the quantization stage, blocks in the DCT domain become sparse, however, if we use CS on the whole block the Entropy coding compression is severely affected. As a result, we split the DCT coefficients between Entropy coding path and CS path followed by its Entropy coder. As an added value for CS, partial encryption is achieved. To split the DCT coefficients to Entropy and CS paths, we developed five different algorithms; each algorithm uses a unique method to split every 8×8 block in the image into two parts. First part is encoded using Huffman coding, while the second part goes through compression stage using CS, then encoded using Huffman coding. At the end, we combine encoded parts to get the compressed and encrypted image. To strengthen the image encryption, we use the CS secret key to shuffle image blocks using Arnold Cat Map. The five algorithms are tested on 15 popular images and the results show that 2 techniques can achieve compression gain over JPEG as well as the partial encryption, all at a PSNR very close to JPEG.
Secure Information Hiding Using Block Match Coding For VQ - Compress Images
Data is very essential in information system, so protecting the data from hackers is very important while transferring the data from one location to another. In this paper, an effective data hiding scheme is proposed which will help in achieving the aim of hiding data into compressed images. These compressed images can be reconstructed without any loss after the secret data is extracted at the decoder. For compressing the images Vector Quantization (VQ) technique is used. In VQ, index modifying and side match VQ (SMVQ) techniques can be used to hide data. Data hiding done by SMVQ technique can provide higher embedding capacity and lower bit rate but it is more time consuming. In contrast, data hiding done by index modifying technique can result into lower embedding capacity and a higher bit rate but it is less time consuming. The proposed scheme will try to merge the advantages of these two techniques while removing the disadvantages of others.
IJERT-Secure Information Hiding Using Block Match Coding for VQ - Compress Images
International Journal of Engineering Research and Technology (IJERT), 2014
https://www.ijert.org/secure-information-hiding-using-block-match-coding-for-vq-compress-images https://www.ijert.org/research/secure-information-hiding-using-block-match-coding-for-vq-compress-images-IJERTV3IS050330.pdf Data is very essential in information system, so protecting the data from hackers is very important while transferring the data from one location to another. In this paper, an effective data hiding scheme is proposed which will help in achieving the aim of hiding data into compressed images. These compressed images can be reconstructed without any loss after the secret data is extracted at the decoder. For compressing the images Vector Quantization (VQ) technique is used. In VQ, index modifying and side match VQ (SMVQ) techniques can be used to hide data. Data hiding done by SMVQ technique can provide higher embedding capacity and lower bit rate but it is more time consuming. In contrast, data hiding done by index modifying technique can result into lower embedding capacity and a higher bit rate but it is less time consuming. The proposed scheme will try to merge the advantages of these two techniques while removing the disadvantages of others.
Image Compression and Encryption: An Overview
2012
Existing methods when describe Compression there is no consideration of security, similarly when it describe encryption there is no consideration of size i.e. compression. Image Compression is concerned with minimizing the number of bit required to represent an image. Image Encryption is hiding image from unauthorized access with the help of secret key that key can be private or public. In this paper the simultaneous image compression and encryption algorithm used by different researchers are categorised and analysed with reference to the performance evaluation parameters.
Overview on Selective Encryption of Image and Video: Challenges and Perspectives
EURASIP Journal on Information Security, 2008
In traditional image and video content protection schemes, called fully layered, the whole content is first compressed. Then, the compressed bitstream is entirely encrypted using a standard cipher (DES, AES, IDEA, etc.). The specific characteristics of this kind of data (high-transmission rate with limited bandwidth) make standard encryption algorithms inadequate. Another limitation of fully layered systems consists of altering the whole bitstream syntax which may disable some codec functionalities. Selective encryption is a new trend in image and video content protection. It consists of encrypting only a subset of the data. The aim of selective encryption is to reduce the amount of data to encrypt while preserving a sufficient level of security. This computation saving is very desirable especially in constrained communications (real-time networking, high-definition delivery, and mobile communications with limited computational power devices). In addition, selective encryption allows preserving some codec functionalities such as scalability. This tutorial is intended to give an overview on selective encryption algorithms. The theoretical background of selective encryption, potential applications, challenges, and perspectives is presented.
Joint compression and encryption of visual data using orthogonal parametric transforms
Bulletin of the Polish Academy of Sciences Technical Sciences, 2016
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 characteri...