Improved Hash Message Authentication Code Using HSV Color Image And Steganography

The information hiding is divided into watermarking and steganography. We shall try tofocus on the steganography and show how can this technique has been used. The mainobjective of the steganography implementation is hides the information under the media cover.So, this will lead for preventing intruder to find out the embedded information in that media.This is the major distinction between steganography and any other methods of hiddeninformation transferring. Steganalysis is the key technology of attacking steganography. Onthe other hand, one of the authentication functions is Message Authentication Code (MAC). Itis a function that produces a fixed-length value that serves as the authenticator results frommessage and a secret key. MACs permits to send a message between two parts (from thesender to the receiver) in such a way that detects any modification to the message en-route bythe receiver. As an authentication function, it faces a number of threats such as bruteforce-attacks and cryptanalysis. Also, the secure MAC must resist existential forgery under anadaptive chosen-message attack.In the proposed scheme, we have proposed an algorithm based on using the Hue,Saturation, Value (HSV) colour space image steganography merging with cryptography tools.Where the hidden information is encrypts and divides into three blocks then embeds to each ofthe three layers of the (HSV) image. My proposed scheme has been employed to make sure ofthe Message Authentication Code (MAC). The secret code will be obtained when the receiververifies the sender identity through the same shared key which is used by both of them inencryption\decryption function.Our proposed scheme concentrates on building a robust authentication scheme that resistswell-known attacks. It involves two components, sender and receiver, also, divides into twophases, setup and verification. In setup phase, both of sender and receiver encrypt its identityand send it to each other. With the same procedure, both of them generate, encrypt and sharesecret key. Now, each of sender and receiver computes shared key (SK) to prepare it for thenext phase. In verification phase, the sender selects a random number and uses it to compute anew shared key which has been used by him to encrypt the message then send it to receiver. Also, it uses only one time to make our scheme more secure. The sender encrypts its identityby using a new value of shred key then divides it to three blocks. He selects a random colorimage, splits it to three layers, then, embeds each block inside each layer. Furthermore, sendsrandom number, encrypted message and the stego-image to the receiver. Finally, the receiverfollows the same procedure as the sender, when he computes a new shared key based on thereceiving random number from the sender. He separates the receiving stego-image into threelayers for extracting the three blocks. Then, he accumulates these blocks to retrieve thesender’s anonymous identity. The receiver verifies the sender’s identity when he compares thesender’s anonymous identity in the verification phase with that one which he calculates insetup phase. If so, the receiver can decrypt the message depending on the new shared key,otherwise, he is an attacker.Experimental results and security analysis illustrate that our approach has a goodperformance and can withstand the common security attacks as well.