South Asian Journal ofEngineering and Technology Vol.4, No.1 (2018) 8–13
ISSN No: 2454-9614
[S1]
Efficient Steganography In Encoded Video Streams Using Motion Vector Difference
S.Tharani
S.Kavitha Bharathi
Kongu Engineering College,
Perundurai, Erode.
Tamilnadu, India.
*Corresponding Author: S.tharani
Phone: +91-7904383253
E-mail: ,
Received: 10/9/2017, Revised: 12/10/2017 and Accepted: 4/1/2018
Abstract
The high Generally, digital video sometimes are stored and processed in an encrypted format to maintain privacy and security. For the purpose of content notation, it is necessary to perform data hiding in these encrypted videos. In this way, data hiding in encrypted domain without decryption preserves the confidentiality of the content. In addition, it is more efficient without decryption followed by data hiding and re-encryption. This project proposes a novel scheme of data hiding directly in the encrypted version of AVI video stream, which includes the following three parts, i.e.,.AVI video encryption, data embedding, and data extraction. By analyzing the property of AVI codec and the codewords of motion vector differences are encrypted with stream ciphers. Then, a data hider may embed additional data in the encrypted domain by using codeword substitution technique, without knowing the original
video content. In order to adapt to different application scenarios, data extraction can be done either in the encrypted domain or in the decrypted domain. Furthermore, video file size is strictly preserved even after encryption and data embedding. Experimental results have demonstrated the feasibility and efficiency of the proposed scheme.
Keywords: Steganography, Least significant bits, Triple DES encoding, decoding, Perturbation.
1. Introduction
In recent years, signal processing in the encrypted domain has attracted considerable research interest. As an effective and popular means for privacy protection, encryption converts the ordinary signal into unintelligible data, so that the traditional signal processing usually takes place before encryption or after decryption This project proposes a novel scheme for classic data hiding in encrypted images or video files. In the first phase, a content owner encrypts the original uncompressed image /video using an encryption key. Then, a data-hider may replace the least significant bits of the encrypted image using a data-hiding key to create a sparse space to accommodate some additional data. With an encrypted image or video containing additional data, if a receiver has the data-hiding key, he can extract the additional data though he does not know the image content. If the receiver has the encryption key, he can decrypt the received data to obtain an image similar to the original one, but cannot extract the additional data. If the receiver has both the data-hiding key and the encryption key, he can extract the additional data and re cover the original content without any error by exploiting the spatial correlation in natural image when the amount of additional data is no too large. The process of data hiding method consists of following three main procedures such as Image encryption, data embedding and data extraction/image recovery. The separable scheme the content owner encrypts the original uncompressed image
using an encryption key to produce an encrypted image. Then using a data-hiding key the data-hider compresses the Least Significant Bits (LSB) of the encrypted image to create some space to accommodate the additional data. As the data embedding only affects the LSB a decryption with the encryption key may result in an image similar to the original version. With an encrypted image containing additional data which is hidden case one is when the receiver has only the data- hiding key, he is able to extract the additional data even if he does not know the image content.
II. RELATED WORKS
Study on Separable Reversible Data Hiding in Encrypted Images Rini.J et al [6] describe the secure and authenticated discrete reversible data hiding in cipher images deals with security and authentication. In the first phase, a content owner encrypts the original uncompressed image using an encryption key. Then, a data hider may compress the least significant bits of the encrypted image using a data hiding key to create a sparse space to accommodate some additional data. In order to improve the security features in data transfers over the internet, many techniques have been developed like: Cryptography, Steganography.
Reserving Room before Encryption Using Reversible Data Hiding Technique Divya h. T et al [3] describe the data hacking is very challenging problem in today’s internet world. There are number of techniques to secure the data. So Reversible Data Hiding (RDH) in encrypted image is used. With this method original cover can be recovered. Reversible data hiding (RDH) in images is a technique, by which the original cover can be losslessly recovered after the
embedded message is extracted. This important technique is widely used in medical imagery, military imagery and law forensics, where no distortion of the original cover is allowed. Watermarking of Compressed and Encrypted JPEG2000 Images D.Prabhakar et al [4] describe the IMAGE watermarking, which is finding more and more support as a possible solution for the protection of intellectual property rights. It is possible to state that the most important features a watermarking technique to be used for IPR protection should exhibit are unobtrusiveness and robustness. There are two main drawbacks using such schemes. Firstly, if the encryption is performed on a message size of few bits, the size of the cipher text may expand leading to loss of compression efficiency.III. METHODOLOGY
A novel scheme of data hiding in the encrypted version of AVI videos is presented, which includes three parts, i.e., AVI video encryption, data embedding and data extraction. The content owner encrypts the original AVI video stream using standard stream ciphers with encryption keys to produce an encrypted video stream.
Then, the data-hider (e.g., a cloud server) can embed the additional data into the encrypted video stream by using codeword substituting method, without knowing the original video content. At the receiver end, the hidden data extraction can be accomplished either in encrypted or in decrypted version.
EXISTING METHODOLOGY
In existing system, the Motion Vector Difference (MVD) Encoding is carried out as follows. In order to protect both texture information and motion information, not only the IPMs but also the motion vectors should be encoded. In avi file, motion vector prediction is further performed on the motion vectors, which yields MVD. The values of MVDs are taken. For Data Embedding: In the encrypted bitstream of avi frames, the
proposed data embedding is accomplished by substituting eligible codewords of various Levels. Since the sign of Levels are encrypted, data hiding should not affect the sign of Levels. For Data Extraction: In this scheme, the hidden data can be extracted either in encrypted or decrypted domain. Data extraction process is fast and simple.
PROPOSED METHODOLOGY
In proposed system, all the existing system implementation is carried out. In addition, the given raw data is perturbed first, then encrypted with 3DES encryption and addition secure key is also embedded in the message. Then the data is embedded in video file. During decryption, the original video file as well as the decrypted data is retrieved. Then the data is decrypted and the perturbed data is found out. Then the original raw message is retrieved. Both original video and raw data is retrieved. The final video is both in encrypted format or original format. Perturbing the raw data is carried out and encryption mechanism of raw text data is also carried out for additional security. The operation may be carried out in two types. A) First data extraction followed by Video decoding or B) Video decoding followed by data extraction.
Perturbation A perturbation is a small change in the movement, quality, or behavior of something, especially an unusual change, so that the receiver cannot the identify the actual or original data. 'Perturbation' means 'disturbance', so in the same way that you would use 'disturbance'. 'Perturbed' has the extended meaning of 'discomfited' or 'made uneasy'. Triple DES Algorithm This algorithm is executed before the data embedding with the video file. Prior to using TDES (Triple Data Encryption Standard), generate and distribute a key K, which consists of three different DES (Data Encryption Standard) keys K1, K2 and K3. This means that the actual 3TDES key has length 3×56 = 168 bits. The encryption scheme is illustrated as follows −
Encrypt the plaintext blocks using single DES with key K1. Now decrypt the output of step 1 using single DES with key K2. Finally, encrypt the output of step 2 using single DES with key K3.
The output of step 3 is the ciphertext. Decryption of a ciphertext is a reverse process. User first decrypt using K3, then encrypt with K2, and finally decrypt with K1. Due to this design of Triple DES as an encrypt–decrypt–encrypt process, it is possible to use a 3DES implementation for single DES by setting K1, K2, and K3 to be the same value. This provides backwards compatibility with DES. Second variant of Triple DES is identical to 3TDES except that K3is replaced by K1. In other words, project encrypt plaintext blocks with key K1, then decrypt with key K2, and finally encrypt with K1 again. Therefore, 2TDES has a key length of 112 bits. Triple DES systems are significantly more secure than single DES, but these are clearly a much slower process than encryption using single DES.
IV. RESULTS AND DISCUSSION
First design a simplified mechanism to determine the number of neighboring nodes for any given node. Within time Tv, the given node crosses through an area and meets a number of neighbors N. Since mobile nodes are assumed uniformly distributed in the network, we may approximate N by
Where r denotes the transmission range of nodes, v is the velocity, and p is the density of nodes in the network. Based on the obtained number of neighboring nodes N, we can on firm the value of threshold K.
Table 4.1 LSB -Secure Transmission
S.NO NUMBER OF TIME SLOT (M)
RATIO OF SECURE TRANSMISSION NODE
1 10 0.43
2 20 0.52
3 40 0.61
4 60 0.69
5 80 0.74
6 100 0.80
7 120 0.86
8 140 0.90
9 150 0.93
10 160 0.97
Fig 4.1 LSB Secure Transmission
S.NO NUMBER OF TIME SLOT (M)
RATIO OF SECURE TRANSMISSION NODE
1 10 0.48
2 20 0.57
3 40 0.66
4 60 0.72
5 80 0.77
6 100 0.83
7 120 0.89
8 140 0.92
9 150 0.95
10 160 0.98
Fig 4.2 Code Word Secure Transmission
LSB Techniques
0
0.2
0.4
0.6
0.8
1
1.2
1 2 3 4 5 6 7 8 9 10 Number of Image
Accuracy (%)
LSB Techniques
Code Word Techniques
0
0.2
0.4
0.8
1
1.2
1 2 3 4 5 6 7 8 9 10 Number of Image
Accuracy (%)
Code Word Techniques
Table 4.3 Comparisons for SEEN and HASH Secure Transmission
S.NO NUMBER OF TIME SLOT (M)
RATIO OF SECURE TRANSMISSION NODE
LSB Code Word
1 10 0.43 0.48
2 20 0.52 0.57
3 40 0.61 0.66
4 60 0.69 0.72
5 80 0.74 0.77
6 100 0.80 0.83
7 120 0.86 0.89
8 140 0.90 0.92
9 150 0.93 0.95
10 160 0.97 0.98
Fig 4.3 LSB and Code Word Transmission
V. CONCLUSION
The reversible data hiding in encrypted image is investigated. Most of the work on reversible data hiding focuses on the data embedding/extracting on the plain spatial domain. But, in some applications, an inferior assistant or a channel administrator hopes to append some additional message, such as the origin information, image notation or authentication data, within the encrypted image though he does not know the original image content. And it is also hopeful that the original content should be recovered without any error after image decryption and message extraction at receiver side. At present, data hiding is completed entirely in the encrypted domain and the method can preserve the confidentiality of the content completely. With an encrypted video containing hidden data, data extraction can be carried out either in encrypted or decrypted domain. But, the video taken in the avi file only. In future various kinds of file formats can be taken for the entire process. Also, the data hiding process with no degradation in video quality can be carried out.
LSB and Code Word Techniques
0
0.2 0.4
0.6
0.8 1
1.2
1 2 3 4 5 6 7 8 9 10 Number of Image
Accuracy (%)
LSB
Code Word Techniques
VI.REFERENCES
[1]W. J. Lu, A. Varna, and M. Wu, “Secure video processing: Problems andchallenges,” in Proc. IEEE Int. Conf. Acoust., Speech, Signal Processing, Prague, Czech Republic, May 2011, pp. 5856–5859.
[2] B. Zhao, W. D. Kou, and H. Li, “Effective watermarking scheme in the encrypted domain for buyer-seller watermarking protocol,” Inf. Sci., vol. 180, no. 23, pp. 4672–4684, 2010.
[3] P. J. Zheng and J. W. Huang, “Walsh- Hadamard transform in the homo- morphic encrypted domain and its application in image watermarking,” in Proc. 14th Inf. Hiding Conf., Berkeley, CA, USA, 2012, pp. 1–15.
[4] W. Puech, M. Chaumont, and O. Strauss, “A reversible data hiding method for encrypted images,” Proc. SPIE, vol. 6819, pp. 68191E-1–68191E-9, Jan. 2008.
1
[S1]SAJET office will update with volume, Issue and page numbers