Tuesday, June 14, 2016

Secure Data Transfer in Video Data Hiding Using DCT, CDCS and Blowfish Algorithm



Mr. M. Karthik (Research scholar)
Department of Computer Science
Tamil University, Thanjavur
Tamilnadu,india
Karthikrj69@gmail.com

Mr. K. Ravikumar (Assistant Professor)
Department of Computer Science
Tamil University, Thanjavur
Tamilnadu,india
ravikasi2011@yahoo.com





Abstract: Steganography is the art or apply of concealing a communication, image, or file within another image, or file. Video data hiding is still an important study topic due to the design complexities concerned. In this thesis Video Steganography is develop to improve security of information by hiding data inside video. There are many methods in the existing system like hiding data within image and using cryptography techniques for defending secured information, but this technique hide message into the image file so extend video steganography using DCT and CDCS Technique to hide text, doc file, image file inside the video file to increase security and secure information length. This method also contains a temporal synchronization plan in arrange to with stand frame drop and inserts attacks. The hidden data can be recovered reliably attacks, such as data compression and limited amounts of image tampering and image resizing. Video inside hidden object encrypt and decrypt using blowfish algorithm reason is to get better security for user secret data’s

Keywords: Information Hiding, DCT, Video, CDCS, Blowfish, Encryption Process, Decryption Process, selective embedding



                                                                                                                                                                I.          Introduction

The well-known of the Internet and WWW has changed the method digital data is handled. Data hiding deals with the facility of embedding data into a digital cover with a minimum amount of perceivable squalor, i.e., the embedded data is hidden or low to a human observer. Data hiding consists of two sets of data, specifically the cover medium and the embedding data, which is called the message. Transform domain is generally preferred for hiding data since, for the equal strength as for the spatial domain; the result is more satisfying to the Human Visual System (HVS).
We seek to embed much larger volumes of data than required for hiding inside the video, targeting applications such as steganography and seamless upgrade of communication and storage systems, rather than digital privileges management. Second, because of our target applications, we aim for strength not against malicious attacks such as Stir mark’s geometric attacks, but against “natural” attacks, such as compression (e.g., a digital image with secret content may be compressed as it change hands or as it goes over a low bandwidth link in a wireless network). Uncompressed video data has been utilized by the majority of the video data hiding methods. A big quantity change domain data hiding in MPEG-2 videos is proposed by Sarkar et al. [2].
 Cryptology is procedure of converting plain text to cipher text and vice versa.  Cryptology deals with usage different variety of cryptosystems to encrypt and decrypt the data with the use of a key. Private key cryptographic technique is one in which the same key is used to encrypt and decrypt the message Cryptography and key replace techniques are well described in [3-6].
Steganography, future from the Greek words stegos, meaning cover and graphia which means writing, is the art and knowledge of hiding the fact that communication is taking place. Steganography and cryptography are strongly related. Cryptography scramble messages so they cannot be understand. Steganography on the other hand, will hide the message so there is no information of the existence of the message in the original place .In some situations, sending an encrypted message will arouse misgiving while an invisible message will not do so [7].

                                                                                                                                                               II.         related work

Nithin n, AnunKumar M Bongle G. P. Hegde in [8] have planned Image Encryption based on FEAL algorithm. Quick Encryption Algorithm an encryption/decryption policy for gray scale images is proposed. The FEAL is also called block cipher Encryption algorithm. FEAL works nearly like Data Encryption Standard (DES) algorithm, but it is quicker than DES. The proposed image encryption algorithm is estimation based on histogram learning and key indifference analysis and results obtained are satisfactory. This algorithm has one big drawback; Encryption technique should be not secure enough even if there is little alteration in secret key real image outline is produced after 80% key matching.
Abirand Ali in [9] has proposed a novel chaos-based algorithm for image encryption. at first image pixel points are shuffled using 2D chaotic map. The originality of the image encryption lies in the integration of chaotic substitution technique based on DNA coding and the harmonizing rule. To calculate the security of the proposed method authors have conducted relationship test, information entropy study, histogram study, and key sensitivity analysis and difference analysis between original and encrypted image. This method concludes with effect that “chaotic DNA exchange method enhances the numerical properties of the encrypted image”.
        Xin Zhanga, Weibin Chenn [10]  have proposed a latest Chaotic Algorithm for Image Encryption.  The chaos-based image cryptosystem typically consists of two stages [2]. The pure image is given at its input. There are various stages in the chaos based image cryptosystem. [a]misunderstanding and [b] diffusion. The confusion period is the pixel permutation where the point of the pixels is scrambled over the complete image without disturbing the significance of the pixels and the image becomes unrecognizable. The chaotic behavior is controlled by the early condition and control parameters which are resulting from the 16-character key.In second stage of the encryption Process we are going to change the value of each and every pixel in the whole image an most important device to protect image from attackers. This method has a big disadvantage image size and pixel ratio is increased evaluate than FEAL Algorithm.
 Steganography are being paid more import day by day. Though steganography is a extremely old method of embedding information behind some object, but still this is very efficient for secure data move and data exchange. Today this method is used for digital objects like text, audio, video and images [15]. Some technician develop Secret image is first encrypted by using BLOWFISH algorithm which has extremely good recital and is a most controlling technique compared to other Algorithms type of algorithm (ex AES, DES, RSA) [16]. The video segmentation is a technique of detecting changing frames in video and one of the essential techniques required for able management of video data [17] several video segmentation algorithms have been proposed[18].

                                                                                                                                             III.        proposed methodology

The implementation stage involves secure planning, implementation, investigation of the existing system and it’s constraints on implementation, scheming of methods to achieve exchange and estimate of changeover methods. For more security provided by steganography techniques.
The main aim of the proposed system is to send text message and file behind a video which is imperceptible for human being eye. Here the system is proposed for high authority, robust and Information Hiding the in DCT (Discrete Cosine Transform) domain. A latest encoding method called Class Dependent Coding Scheme (CDCS) is used to raise the embedding capacity, which can communicate the same information using fewer number of bits [11]. High imperceptibility is achieved by selecting well-organized DCT blocks for Embedding data using energy thresholding scheme. On analysis, of a digitized video before and after a message was inserted [11], will show video files that appeared to have no extensive visual differences. The DCT is used to embed the box file, which casts embedded data into the chosen region in the DCT domain [12]. Embed the file in the selected section gives increase to invisibility.
     Text Processing two processes, encryption and decryption together form the cryptographic process. For ensuring security, the Data are encrypted by the sender before transmitting them and are decrypted by the receiver after receiving them so that only the sender and the future person can see the satisfied in the image. Blowfish algorithm which uses a key of variable size up to 448 bits. Blowfish symmetric block cipher algorithm encrypts block data of 64-bits at a time

A.    Blowfish Algorithm

Blowfish algorithm uses a Feistel network for data encryption which iterates the purpose 16 times. Each about include a key needy permutation and data dependent changeover. Process of data encryption and the different steps in encryption are described below as  
Split the 64 bit block into two equivalent blocks having 32 bits size each (XL and XR).
The left block XL is XOR’d with primary constituent of P-block, and thus obtained result is fed to the F function. 1 P
In the F function block, substitution operation is carried out where the given 32 bit input is transformed into another 32 bit output.
The output from F block is XOR’d with right half XR and the results obtained are swapped as shown in the Figure.1
After completing each round successfully, the so formed right half become the new left half or vice versa.
These steps are continued up to 16 rounds.
 The last left and right halves are not swapped but XOR’d with seventeenth and eighteenth P box elements.
So obtain effect is the cipher text which is non comprehensible to outsiders and attackers


http://m.eet.com/media/1075238/0308feat2fig2.gif

Figure.1  blowfish flow

B.   Class Dependent Coding Schema

 Three different non extend beyond special classes.
     Class A  (most frequently appearing character set in secret message),
     Class B (Average frequently appearing) and
     Class C (Less frequently appearing characters).
    Only capital letters, alphanumeric and few special characters will further reduce the number of bits. Needed to represent each character in each class.  Encoding technique based on Huffman encoding schema. We have designed variable length code to represent each class A message “telemedicine” needs only of 61 numbers of bits with CDCS as compared to 84 bits with ASCII. Here we have saved 23 bits (27.38 % saving). This saving can further be increase with increase in message length as well as increase in number of redundancy. The CDCS scheme is not only saving the number of bits per character but also provides security.


m = ( N1+2 N2+2 N3 )+4h          (1)

where,     h= N1+ N2+ N3              (2)
                                                                                                                          
      Table I . If N1, N2 and N3 are the whole number of characters belong to Class A, Class B and Class C respectively, Total number of bits to be embedded is given by below table
      This bit alignment saving can more be increase in message length as well as increase in amount of redundancy. The CDCS scheme is not only saving the quantity of bits per character but also provides protection [20].

Class
Class code
Length
A
1
1-bit
B
00
2-bit
C
01
3-bit

Table I.






Table I  Class data size variation

B.    Discrete Cosine Transform

 DCT is like a encoder and decoder. The first stage of image compression is DCT [11] encoder. It consists of FDCT, quantize, and entropy encoder. The second stage is DCT decoder [13][14]. It consists of entropy decoder, debutanizer and inverse mapped.
·         The input image is N by M
·         f(i,j) is the strength of the pixel in row i and column j;
·         F(u,           v) is the DCT coefficient row k1 and column k2 of the DCT.
·         For most images, much of the indication power lies at less frequencies; these appear in the higher left corner    of  the DCT.

             (1)
For u,v = 0,1,2,3,….7
                                                                                                      (2)
For x,y = 0,1,2,3,….7

·         Compression is achieved since the lesser right values represent upper frequencies, and are often small - small enough to be neglected with small visible distortion
·         The DCT input is an 8 by 8 array of integers. This array contain  pixel's gray scale level;
8 bit pixels have levels from 0 to 255.
(i)  Steps Required dispatcher
·         Select Real input video file uncompressed format
·         Extract video frames select frames (Images) by frames (images) automatically to hide find the free space on the image pixel using DCT
·         To encrypt the secured data of file using blowfish algorithm with secured Key Value.
·         Automatically embedding the selected (encrypted cipher text) to detected free space on selected frame
·         This embedding steps using DCT and CDCS technique, DCT using embedding event and CDCS used to increase data length and data security.
·         Finally getting secured Steganography video file that video definitely viewable format. shown in the Figure.2

Capture.PNG


Figure.2  Dispatcher Side Process Flow to Create Steno Video


(ii) Steps Required Recipient

·         Receive the stegno video file.
·         Select the Stegno video file.
·         Enter the Secure Key value for before retrieving information
·         Extract all frames and select Stegno frames
·         frames one by one  from Stegno video file
·         To divide the real video file and secure data from Stegno video file .shown in the Figure.3
·         Then save or read the real secure data
·         End
Capture1.PNG

Fig ure.3 Recipient Side Process Flow to retrieve secure information from Stego video

IV EXPERIMENTAL RESULTS
This Current system workings on uncompressed grayscale video, but as the video is uncompressed file volume is more this puts limitation on memory. This system is not lossless and reversible as embedding data in frame results in a stable distortion of the original frame or concealed data but within suitable range. This technique video or frame are not loss this real shape or streaming after embedding secure data in video file.
Related results are here getting some video into an single frame only:
Result 1: Embedding Process
      The above frame is selected real video (single frame) that uncompressed video frame. After developed an embedding event with use of DCT, CDCS and Blowfish algorithm with secret key value embedding event done for selected video file. shown in the Figure.4
Fig ure.4 Original image uncompressed image
      .
         Embedding Event = Video +(Secret information + Secret Key)
Example:                                                                                             Video=film.3gp                                                                                Secure-information=hello                                                                      Secret key=lakka123                                                Output=stegnofilm.3gp
Result 1: Retrieving Process
     After Embedding event done after transfer video file for Recipient.Recipient is selecting the Stegno-video and extract frame (to select single Frame foe ex below frame) that is compressed Video frame, but not changing for viewable format at same time that frame have a encrypted secret data inside the frame.When recipient put the secret key then the user got real information from the select video. After retrieving the information at time also that video viewable.
Retrieving Event=Stegno video-(Encrypted Message-secure key)  Real data=stegnofilm.3gp-(Secret encrypted data-lakka123) Real data =hello
      That same time data file also embedding and retrieving in video file in same procedure. shown in the Figure.5
Figure.5  Stegno image compressed image
      This Proposed Technique embedding user secure information or data hidden into the video file use of secure key value. When recipient trying to retrieving secure information embedding video file put the 100% real secure key then only recipient get full secure data otherwise got an Error message and just use Stego video or Segno frame for is fully viewable.
Result 2:The Result 1 Procedure followed same lifecycle another video file and another selected frame. Original image uncompressed image as shown in the Figure.6
Figure.6  Original image uncompressed image
Segno image compressed image as shown in the Figure.7
Figure.7 Segno image compressed image
        This technique using an three main method that is like a DCT (Discrete Cosine Transform), CDCS (Class Dependent Coding Schemes) and blowfish algorithm.
V.   CONCLUSION AND FUTURE WORK
        The proposed methodology is a Information Hiding technique for provides high Information Hiding strength and robustness against the attacks such as compression and tampering. The benefit of the future method is that the embedded message could still be extract after common image processing attacks like compression done at video level and tampering done at frame level. This development simulation results almost similar to the thesis analysis. In future this thesis can be enhanced in the way to generate key for automatically using user data(Ex ,name ,DOB) In this key used to AES algorithm do an encryption and decryption process , And also support on 3gp and  avi video formats future develop on other video formats like mp4, mkv etc. Further this work can be improved by making the feature available for multiple video formats.

                                                                                                                                                        IV.        Acknowledgment

The authors would like to thank the  CS department and anonymous reviewers and associate editor for their comments that greatly improved the manuscript

                                                                                                                                                                   V.         References

[1].S. K. Kapotas, E. E. Varsaki, and A. N. Skodras, “Data hiding in H- 264 encoded video sequences,” in Proc. IEEE 9th Workshop Multimedia Signal Process., Oct. 2007, pp. 373–376.
[2].A. Sarkar, U. Madhow, S. Chandrasekaran, and B. S. Manjunath, “Adaptive MPEG-2 video data hiding scheme,” in Proc. 9th SPIE Security Stegno graphy Watermarking Multimedia Contents, 2007, pp. 373–376.
[3].D. Luciano and Gordon Prichett. Cryptology: From Caesar Ciphers to Public-Key Cryptosystems. The College Mathematics Journal, vol. 18, No. 1, pp. 2-17, January 1987.
[4]. S. T. F. Al-Janabi and M. A. Rasheed. Public-Key Cryptography Enabled Kerberos Authentication. In Proc. Of IEEE conference on Developments in E-systems Engineering, pp. 209-214, Dec. 6-8, 2011.

[5].G.P. Biswas. Diffie–Hellman technique: extended to multiple two-party keys and one multi-party key. Published in IET Information Security, vol. 2, No. 1, pp. 12– 18, 2008.
[6]. R. Sharma. A Novel Approach to combine Public-key encryption with Symmetric-key encryption. The International Journal of Computer Science & Applications, Vol. 1, No. 4, pp. 8-15, June 2012.
[7]. J.R. Krenn, Steganography and Steganalysis, 2004.
[8].Nithin N, Anupkumar M Bongale G. P. Hegde Image Encryption based on FEAL algorithm, 2013
[9] A. Awad and A. Miri. A New Image Encryption Algorithm Based on a Chaotic DNA Substitution Method. In Proc. Of IEEE international conference on communication, pp. 1011-1015, 2012.
[10] Xin Zhang, Weibin Chen, “A New Chaotic Algorithm For Image Encryption”, pp 889-892 IEEE ICALIP2008.
[12]. S. H. Kamali, M. Hedayati, R. Shakerian and M. Rahmani. A New Modified Version of Advanced Encryption Standard Based Algorithm for Image Encryption. In Proc. of International Conference on Electronics and Information Engineering, vol 1, pp. 141-145, 2010.
[10]. Z. Yun-peng, Z. Zheng-jun, L. Wei, N. Xuan, C. Shui-ping and D. Wei-di. Digital Image Encryption Algorithm Based on Chaos and Improved DES.In Proc. of the IEEE International Conference on Systems, Man, and Cybernetics, San Antonio, TX, USA, pp. 474-479, October 2009.
[11].  Asha P. Choudhari (Asst. Prof)MITAOE Alndi “Information Hiding in Video using CDCS and Adaptive Embedding”,  2013.
[12] N.Ahmed,T.Natrajan,and K. R. Rao,”On Image Processing and a Discrete Cosine Transform, IEEE Transactions Computers C-vol 23, no. 1, 1974, pp. 90-93.
 [13].SaadBouguezel, M. Omair Ahmad, and M.N.S. Swamy, “Low-Complexity 8×8 Transform for ImageCompression,” ElectronicsLetters, vol. 44, Oct. 2008.
[14]. SaadBouguezel, M. Omair Ahmad, and M.N.S. Swamy, “A fast 8×8 transform for image compression,” IEEE International Conference on Microelectronics (ICM’2009), Marrakech, Morocco, Dec. 2009, pp.74-77.
[15]. Barnali Gupta Banik  “A DWT Method for Image Steganography” Volume 3, Issue 6, June 2013.
[16].Ms. Hemlata Sharma,Ms. Mithlesh Arya, Mr. Dinesh Goyal “Secure Image Hiding Algorithm using Cryptography and Steganography” Volume 13, Issue 5 (Jul. - Aug. 2013), PP 01-06.
[17] Won-Hee kim,Tae-II Jeong and Jong-Nam Kim “Video Segmentation Algorithm Using Threshold and Weighting Based on Moving Sliding Window” ICACT,2009,pp. 1781-1784.
[18]  Ram Kumar Yadav  “Deformation and Improvement of Video Segmentation Based on morphology Using SSD Technique” Ram Kumar Yadhav et al, Int. J. Comp. Tech. Appl., Vol 2 (5), 1322-1327
[19]. Dr. Nabeel Hashem Kaghed Dr. Tawfiq A. Abbas Wafaa Hassan AL-Marsomi “Video Clip Image Compression Using DCT Technique” University of Babylon, Iraq.
[20].  Dr. Suresh N. Mali ,Content Security Enhancement by Effective Encryption and Sealed Steganography, Ph.D. Thesis.








                                




SEPARATE DATA EXTRACTION IN ENCRYPTED IMAGES BY REVERSIBLE DATA HIDING USING SIRDS

M. KARTHIK                                                                                                                                                                                             Research scholar, Department of  Computer Science,                                                                                                             
 Tamil University, Thanjavur                                                                                    karthikrj69@gmail.com

K.RAVIKUMAR                                                           
Assistant Professor, Department of  Computer Science, Tamil University, Thanjavur                            ravikasi2011@yahoo.com

 ABSTRACT:
Reversible data hiding used to data hidden process in image and also can recover after analyze hidden data in cover image. This RDH schema provides the secrecy of user data’s and also its encoded cover image. Previous methods embedding data in cover(secure) image after retrieving process may be issue is to produced an some errors on data extraction time. most important problem is earlier scheme information hidden in cover image using RDH, hence data retrieval process time were produced an free of errors. In this proposed scheme make SIRDS as secrecy image is share of visual cryptography scheme to reduce transaction risk for both forwarder and receiver like secure information sharing. SIRDS Encoding technique modifies image pixel values using the random dots in the event according to the B-VCS to produce non pixel expansion shares of the B-VCS. Modifying the pixel free dots using a SIRDS will degrade the visual quality of the rebuilder substance. Here, recommend for these model that is based on the visual feature of cover image SIRDS working is based on construction rules for a (2, n)-B-VCS that maximize the cover image contrast and recovered data strength in the cover image using the B-VCS. SIRDS different type of picture separation after the data bit which was hiding multiple set of pixel, For this the data retrieval method‟ require the index position of those blocks which were considered in hiding process and the pixel pairs position where the data is hidden as the input. The experimental results for our proposed method offers better performance over previous work.

INDEX TERMS:
RDH, Privacy Protection, SIRDS, VCS, Pixel Expansion..

INTRODUCTION:
                          
RDH is successful communication technology; desires for information sharing and transfer have increased exponentially. The threat of an eavesdroppers accessing secret information has been an ever existing concern for the information communication in the public region. Steganography and Cryptography are the most widely used techniques to overcome these risks.        
Cryptography involves switching a plain text into an unreadable cipher text. Other hand, Steganography embeds message into a cover media and hides its existence. A digital image is considered as the transporter in these techniques. These techniques make some level of security of user information. However, neither of them alone is secure enough for sharing data over an unsecure communication is vulnerable to intruder attacks and channel. Although these techniques are often combined


together to complete higher levels of security there still is a need of a highly secured system to share information over any communication media minimizing the risk of intrusion.

Visual cryptography is a powerful technique that merges the notions of ciphers and secures sharing in cryptography with that of graphics. VC takes a binary data and divides it into two or more section known as shares. When the shares are written on transparencies and then superimposed, the secret data can be recovered well again. Visual cryptography is a unique technique in the logic that the encrypted message can be decrypted directly by the (HVS). It focuses on resolving the problem of secret sharing. A secure sharing method suggested by Shamir’s and Naor [2] enables allocation of a secret amongst n parties, such that only predefined unauthorized sets will be able to reconstruct the secret information. In a k out of n secret data sharing problem n transparencies are produced and it needs a smallest amount of k shares to retrieve well again the original image (message). The image remains hidden if fewer than k transparencies are stacked mutually. Each and every pixel appears within k modified versions known as shares. The shares are a group of m black and white sub-pixels arranged closely together.
Before the development of digital means, conventional methods were creature used for transferring or receiving messages. Before mail messages, before phones were sent on end. For the messages where privacy was of prime concern, the behavior of implementing protection were following:
·         Write the information using such notations that actual meaning of the message was concealed.
·         choose the messenger skilled of delivering the information securely.
·         secrete the communication such that even its presence can’t be predicted.

In steganography, the possible cover carriers are innocent looking (text, audio, video, and images) which will hold the hidden data. A message is the information hidden and may be cipher text, plaintext, images, or anything else that can be embedded into a bit stream (binary data). The cover carrier and the embedded message create a stego-image (carrier). Embedding data may need stego key which is additional secret data, such as a password, required for hiding the secure information. Example, when secret information is embedding within a cover image, the resulting product is a stego-image like cover image.
A possible formula may be represented as:
Cover medium + embedded message + stego key = stego-medium

DEFINITION :

femd : steganographic function "embedding"
fext : steganographic function "extracting"
Cover: envelop data in which emb will be secreted
Embed: message to be hidden stegno: cover data with the hidden message

Fig 1 the Steganographic System

The benefit of steganography is that can be used to secretly transmit data’s without the reality of the transmission being discovered. Often, using encryption might recognize the receiver or sender as somebody with something to hide.
Reversible data hiding (RDH) in images is a technique, by the original cover can be losslessly recovered after the embedded message be extracted. This important method is widely used in medical descriptions, military imagery and law forensics, where no distortion of the unique cover is acceptable
VISUAL cryptography is a technique that encrypts a secure data into n shares, with each applicant holding one share on secure image; any applicant with fewer than k, 2 ≤ k ≤ n, shares cannot reveal any information about the top secret image. Stacking the k shares reveals the underground image, which can be acknowledged directly by the human visual system [4]. Conventional shares [3]–[1], which consist of many random and meaningless pixels satisfy the security requirement for protecting secret contents, but they have a drawback—there is a high transmission risk because noise-like shares raise the suspicion of attackers, who may intercept the shares. Thus the risk both to the participants and to the shares increases in turn increasing the probability of transmission failure.

PREVIOUS ARTS

All previous techniques hided data by reversibly vacating room from the embedded images, which may be issue to some errors on data retrieval and image restoration.
In a data owner encrypts the original image using a regular cipher text with a secret key. Then producing encrypted image, the data owner hands over it to a data hider and the data hider can embed some auxiliary information into the encrypted image by lossless vacating some room according to a data hiding key. Then a receiver, maybe the data owner himself or an authorized third party can extract the embedded secure data with the data hiding key and further recover the original image(data) from the encrypted version according to the encryption key.
In all techniques of the encrypted 8 bit gray-scale images are generated by encrypting every bit - planes with a stream cipher. The method in fragments the encrypted image into a number of non overlapping blocks sized by each block is used to carry one added bit. The method fragments the encrypted image into a number of non overlapping blocks sized by a * a each block is used to carry one added bit.
To do this, pixels in each block are pseudo-randomly separated into two sets S1 and S2 according to a secure data key. If the extra bit to be embedded is 0, flip the 3 of each encrypted pixel in S1, otherwise flip the 3 encrypted of pixels in S2. data extraction and image recovery, the receiver flips all the three pixels in S1 to form a new decrypted block, and flips all the three  pixels in S2 to form another new block; one of them will be decrypted to the original block. Due to spatial relationship in natural images, original block is presumed to be smoother than hindered block and embedded bit can be retrieval correspondingly. There is a threat of defeat of bit extraction and image recovery when divided block is relatively small or has much fine-detailed textures.
        Hong [11] reduced the error rate of Zhang’s method [16] the pixels in calculating the smoothness of all block and using plane match. The recovery and extraction of blocks are performed according to the descending order of the absolute smoothness difference between two candidate blocks and recovered blocks can further be used to evaluate the smoothness of unrecovered blocks, which is referred to as plane match.
Zhang’s method in [12] pseudo-randomly permuted and divided encrypted image into a number of groups with size of L. The LSB-planes of each one group are compressed with a parity-check matrix and the vacated room is used to embed data. At the receiver side, the 8-P most significant bits (MSB) of pixels are obtained by decryption directly.

PROPOSED METHOD:

Julesz implemented the random-dot format of the stereogram, in which the 3D form find a way around the monocular processes and is visible only when stereoscopic fusion is obtained. A random-dot stereogram (RDS) is a stereo couple of images of random dots, which when viewed with the support of a stereoscope or with the eyes focused on a point in front of behind the images; generate an awareness of depth, with objects appearing to be in front of or behind the display level. Clarke and Tyler proposed a stereoscopic technique that allows the stereoscopic presentation of 3D form from a single printed image by a random dot pattern. That method is known as Random Dot Auto stereograms or Single Image Random Dot Stereogram’s (SIRDS).
The emergence of a SIRDS consists of numerous random dots that have a similar appearance with shares in a Visual Cryptography System. The only difference is that people can reconstruct the original object via binocular disparity from a SIRDS. Hence, hiding a share of a VCS in a SIRDS can decrease suspicion of hidden secrets. The property indicates that the SIRDS is best, and an ordinary, candidate to serve as a cover image for a share of a conventional Visual Cryptography System. This thesis is willing in to developing a technique for sharing visual secrets using SIRDSs.
In the SIRDS, the image contains many random-dot patterns that periodically replicate in the horizontal direction; the stereopsis of the objects arises from differences in the horizontal positions of the image. The pixel allotment in n SIRDSs that were generated independently. Suppose each SIRDS has the same pixel density d, the probability of pixel distribution pattern.
The pixel distribution connecting all SIRDSs are stacked, each all pixel distribution prototype will uniformly appear in the stacked image. It is approximately impossible to make public any meaningful information by stacking two shares together. Try to modify any pixels in SIRDSs such that the modified SIRDSs can share secret Information (images) the same way as VCSs. In the following, will inspect whether the modified pixels in a SIRDS will interfere with the visual effect of stereopsis in the SIRDS.
This observation indicates that the altered SIRDSs can be detected by a human visual system, thus making it difficult to share extra information in RDS. Hence, there are a transaction between keeping the visual quality of stereopsis in a SIRDS and producing a high-quality VCS. When try to construct a specific VCS from a set of SIRDSs, it may be necessary to alter a large number of random pixels to observe the pixel distribution regulation of the VCS. However, these altered pixels can be perceived as an illusion of 3D depth and these interfere with the original stereopsis in the SIRDS. On the above observation, formulated a mathematical optimization model to discover an most favorable solution to share a secret image in SIRDSs where the objective is to maximize contrast under the restriction of the visual quality of SIRDSs. Using this model, dealers can adjust the visual quality of SIRDSs to obtain the best display quality of the recovered images.
This implementation propose a (2, k)-BVCS for sharing a binary secret image in n SIRDSs. The proposed encryption process is shown in Fig. 2. The first phase, n depth maps are used to produce n SIRDSs using the auto stereogram generator. In the proposed (2,k)-BVCS, each depth map has the same image size and all generated SIRDSs have the same pixel density d.
Fig 2 two-phase encryption process of (k, n)-BVCS.
The construction rules generator, based on given parameters, n and d, of each SIRDS, generates guidelines for altering pixels in the SIRDSs. The encryptor alters pixels only within a specific region, which is called the encryption region, where black secret pixels appear. Due to the altered pixels could be disclosed in the verification image of a SIRDS. To preserve the security condition for each share of the BVCS, the encryption region will be enlarged to cover neighbors of the black secret pixels. The construction rules of a BVCS consist of two (n + 1) × (n + 1) matrices, M0 and M1, for sharing white and black secret pixels in a secret image.
Next, design an encryption algorithm for the BVCS encryptor. Based on the modification rule for a given BVCS, the algorithm alters pixels on n SIRDSs, ST1,. . ., STn , to share a binary secret SE.


Fig 3 Architecture Diagrams



EXPERIMENTS AND COMPARISONS:

In this section, discuss an experiments that conducted to evaluate the presentation of the development new method (2, k)-BVCSs. also there present some demonstrations of the execution results for observing the visual effects of the BVCSs. Finally, compare the properties of this study with previous approaches.

Histogram Comparison


Original histogram
The calculate approximately error is estimate via some data can be embedded into the estimating error sequence with histogram shift.


Shifted histogram

The development can be as high as 2 to 4 dB at low embedding rate. As for quality images such as Baboon with rather flat error histogram, the second solution has a better performance of 1 to 2 dB.

Encoding and Decoding Time Comparison
Encoding  Time Comparison
Encoding Rate
CONCLUSION:

SIRDS is a new method drawing attention because of the privacy requirements from public environment information management. Earlier method implement RDH in encrypted images by vacating room after encryption, which proposed by reserving room before encryption. This thesis work proposed a (k, n)-BVCS and developed a new technique for hiding a size-invariant in n SIRDSs. This work explored the possibility of hiding a share of a VCS in SIRDS that are printed on transparencies. The greatest recovered images in (k, n)-B-VCS, 2 ≤ n ≤ 10, ranges and SIRDs can produce clear recovered images for a (k, n)-B-VCS. The experimental results establish the effectiveness and the flexibility of the proposed (k, n)-BVCS efficient encoding rate and processing time little bit is increased. In the future work secure information will be encrypt then embedding into the secret image like second time verification, that encryption algorithm like AES, Blowfish and RSA etc.

REFERENCES:
[1] M. Naor and A. Shamir, “Visual cryptography,” Advances in Cryptology—EUROCRYPT (Lecture Notes in Computer Science). New York, NY, USA: Springer-Verlag, 1995, pp. 1–12.
[2] R. Ito, H. Kuwakado, and H. Tanaka, “Image size invariant visual cryptography,” IEICE Trans. Fundam. Electron., Commun., Comput. Sci., vol. E82-A, no. 10, pp. 481–494, 1999.
[3] C. N. Yang, “New visual secret sharing schemes using probabilistic method,” Pattern Recognit. Lett., vol. 25, no. 4, pp. 481–494, Mar. 2004.
[4] P. L. Chiu and K. H. Lee, “A simulated annealing algorithm for general threshold visual cryptography schemes,” IEEE Trans. Inf. Forensics Security, vol. 6, no. 3, pp. 992–1001, Sep. 2011.
[5] J. Tian, “Reversible data embedding using a difference expansion,” IEEE Trans. Circuits Syst. Video Technol., vol. 13, no. 8, pp. 890–896, Aug. 2003.
[6] Z. Ni, Y. Shi, N. Ansari, and S. Wei, “Reversible data hiding,” IEEE Trans. Circuits Syst. Video Technol., vol. 16, no. 3, pp. 354–362, Mar. 2006.
[7] D.M. Thodi and J. J. Rodriguez, “Expansion embedding techniques for reversible watermarking,” IEEE Trans. Image Process., vol. 16, no. 3, pp. 721–730, Mar. 2007.
[8] X. L. Li, B. Yang, and T. Y. Zeng, “Efficient reversible watermarking based on adaptive prediction-error expansion and pixel selection,” IEEE Trans. Image Process., vol. 20, no. 12, pp. 3524–3533, Dec. 2011.
[9] P. Tsai, Y. C. Hu, and H. L. Yeh, “Reversible image hiding scheme using predictive coding and histogram shifting,” Signal Process., vol. 89, pp. 1129–1143, 2009.
[10] L. Luo et al., “Reversible imagewatermarking using interpolation technique,” IEEE Trans. Inf. Forensics Security, vol. 5, no. 1, pp. 187–193, Mar. 2010.
[11] V. Sachnev, H. J. Kim, J. Nam, S. Suresh, and Y.-Q. Shi, “Reversible watermarking algorithm using sorting and prediction,” IEEE Trans. Circuits Syst. Video Technol., vol. 19, no. 7, pp. 989–999, Jul. 2009.
[12] A. J. Menezes, P. C. van Oorschot, and S. A. Vanstone, Handbook of Applied Cryptography. Boca Raton, FL, USA: CRC, 1996.
[13] K. Hwang and D. Li, “Trusted cloud computing with secure resources and data coloring,” IEEE Internet Comput., vol. 14, no. 5, pp. 14–22, Sep./Oct. 2010.
[14] M. Johnson, P. Ishwar, V. M. Prabhakaran, D. Schonberg, and K. Ramchandran, “On compressing encrypted data,” IEEE Trans. Signal Process., vol. 52, no. 10, pp. 2992–3006, Oct. 2004.
[15] T. Guo, F. Liu, and C. Wu, “k out of k extended visual cryptography scheme by random grids,” Signal Process., vol. 94, pp. 90–101, Jan. 2014.
[16] Z. Zhou, G. R. Arce, and G. D. Crescenzo, “Halftone visual cryptography,” IEEE Trans. Image Process., vol. 15, no. 8, pp. 2441–2453,
Aug. 2006.
[17] Z. Wang, G. R. Arce, and G. D. Crescenzo, “Halftone visual cryptography via error diffusion,” IEEE Trans. Inf. Forensics Security, vol. 4, no. 3, pp. 383–396, Sep. 2009.
[18] F. Liu and C. Wu, “Embedded extended visual cryptography schemes,” IEEE Trans. Inf. Forensics Security, vol. 6, no. 2, pp. 307–322, Jun. 2011.
[19] H. W. Thimbleby, S. Inglis, and I. H. Witten, “Displaying 3D images: Algorithms for single-image random-dot stereograms,” Computer, vol. 27, no. 10, pp. 38–48, Oct. 1994.
[20] W. Zhou and A. C. Bovik, “A universal image quality index,” IEEE Signal Process. Lett., vol. 9, no. 3, pp. 81–84, Mar. 2002.


JOURNAL PUBLISHING CERTIFICATES