A Novel Approach to Separable Reversible Data Hiding

7/23/2019 A Novel Approach to Separable Reversible Data Hiding

http://slidepdf.com/reader/full/a-novel-approach-to-separable-reversible-data-hiding 1/5

A Novel Approach Towards Separable Reversible

Data Hiding Technique

Vt Am

Department of Computer Engineering

R C Patel Institute of Technology,Shirpur.Dist.Dhule, Maharashtra, [email protected]

Abstract- Internet is the most popular communicationmedium now a days but message communication over theinternet is facing some problem such as data security, copyrightcontrol, data size capacity, authentication etc. There are so many

research is progressing on the eld like internet security,steganography, cryptography. When it is desired to send thecondential/important/secure data over an insecure andbandwidth-constrained channel it is customary to encrypt as well

as compress the cover data and then embed thecondential/important/secure data into that cover data. This

paper introduces the new way of originating the existing concepti.e. separable reversible data hiding. Actually the concept of

separable reversible data hiding technique is based onsteganography and related with internet security. The chiefobjectives of this literature is to work on the concept in which weused text as a hidden data, no plain spatial domain is used,attempt to increase the amount of data which is to be hide,evaluating quality by different interpretations. The principalnotion of separable reversible data hiding is consist of three keyprocedures. First encrypt the cover media second hide the data

and third get the data as well as cover media as per provisions.

Keywords- Image encption, image recovery, reversible datahiding, separable reversible data hiding, embedded data,datahiding

key,qa index,PSNR.

I. VERVW

Now a day the data security and data integrity are the twochallenging areas for research. There are so many research is

progressing on the eld like inteet secrity, steganography,crytography. Sometimes we fond certain distortion in images used in military, medical science which is un-acceptable.Hence for data hiding we have a technique using which we canextract data correctly and aer that original cover content can be perfectly recovered. This technique is known as reversibledata hiding. This technique is also called as lossless, distortionee, or invertible data hiding technique [1]-[2]. Reference [3] presented a unique reversible (ossless) data hiding techniquewhich enables the exact recovery of the original signal with theextraction of the embedded information. And this exactrecovery with lossless data is nothing but the reversible datahiding. Usually the well-known LSB (least signicant bits)method is used as the data embedding method. Reversible datahiding is a technique that is mainly used for the authenticationof data like images, videos, electronic documents etc. The chief

978-1-4799-2900-9/14/$31.00 ©2014 EEE

Trk Pwr

Department of Information Technology

R C Patel Institute of Technology,Shirpur.Dist.Dhule, Maharashtra, India [email protected]

application of reversible data hiding technique is in IPR(Intellectual Property Rights) protection, authentication. Insome application scenarios it is essential to provide security,authentication and privacy during communication or

transferring data. That's why to hide the data or to provide thedata secrity we need some new approach in commnication.

II. EPRE EVERSE AA HDNG TECQUE

The term "reversible data hiding means getting the exact

recovery of the data aer performing the process likeencrytion-decrytion and data hiding. Now the question is;what is mean by "separable reversible data hiding technique?The word separable means it separates two major activities in the scheme. These two activit ies are getting the exact recoveryof the secure hidden data and exact recovery of cover datawhich is used to hide as shown in Fig..

Or i g nal 'm •

!

I �

•

l

Ecryp ted image cotainig ebded

Re ered

im g

; �s I

exced

bts

Fig The scheme of separable reversible data hiding []

The Author in [4] uses image as a cover medium. Thescheme is divided into three steps in the rst step; a sender orcontent owner encrts the cover image using an encrtionkey. Then, a data-hider compresses the least signicant bits of

771



te encrypted mage usng a datadng key t create enugspace t accmmdate sme addtna data (Secure data).wat recever sde t ccurs tree cases as swn n Fg. 2 casene s f a recever as te datadng key ny e can take ut te secre data even e des nt knw te cver meda .e.cver mage cntent. In secnd case f te recever as teencryptn key ny e can decrypt te receved data t tanan mage smar t te rgna ne ut e cannt extract teaddtna data. If te recever as t te keys .e. datadngkey and te encryptn key e can exact te addtna data

and recver te rgna mage. Tus we are separatng te tactns .e. exact recvery f te dden data and recvery f te cver meda. Tats wy t s termed as "SeparaeReverse Data Hdng Tecnque wc s reverse as weas separae n nature.

III. MOTIVATION AND ELATED WORK

st f te reverse data dng tecnques are ntseparae nt ased n encryptndecryptn dman nt ased n RGBSB stegangrapy. Here presents te smasurvey tat reveas wat tecnques ave een used frcmpressndecmpressn encryptndecryptn dataemeddng etc.

Reverse data dng tecnque ncudes fwngactns ke cmpressndecmpressn encryptndecryptn data emeddngdata extractng creatng space atSB f te pxes f te mage prvdng securtyautentcatn usng autmatc key generatn and etc. Te tradtna way f transmttng redundant data s t rstcmpress te data t reduce te redundancy and ten tencrypt te cmpressed data. At te recever sde tedecryptn and decmpressn peratns are rdery perfrmed t recver te rgna cver data. Hwever nsme appcatns a sender needs t transmt sme data t terecever and wses t keep te nfrmatn cndenta t a

c

v

s

netwrk peratr w prvdes te canne resurce fr te transmssn means te sender sud encrypt te rgnadata .e. mage n ts case and te netwrk prvder cmpress te encrypted data wtut any knwedge f tecryptgrapc key and te rgna data. At recever sde trecnstruct te rgna data a decder ntegratngdecmpressn and decryptn nctns w e used.

Tere are severa tecnques frcmpressng/decmpressng encrypted data ave een

deveped. Wen t s desred t transmt redundant data veran nsecure and andwdtcnstraned canne t s usua trst cmpress te data and ten encrypt t. In 5 tese stepsare n reverse rder f tat s rst encryptng and tencmpressng wtut cmprmsng eter te cmpressnefcency r te securty. Tey ave examned te psstyf rst encryptng a data stream and ten cmpressng t suc

tat te cmpressr des nt ave knwedge f teencryptn key.

Reference 6 suggested a ssess cmpressn metd frencrypted gray mage usng resutn prgressvedecmpstn n wc tere s muc etter cdng efcencyand ess cmputatna cmpexty. In ts paper 6 resutn

prgressve cmpressn sceme was mpemented wc

cmpresses an encrypted mage prgressvey n resutnsuc tat te decder can serve a wresutn versn f te mage studes te statstcs ased n t and use tsstatstcs t decde te next resutn eve and ts prcessterates unt ast eve f resutn. Here te mage underges streamcper ased encryptn efrecmpressn.

In paper 7 tere s a uyerseer watermarkng prtcwc s te cncept f dgta watermarkng. In ts prtc te seer des nt get t knw te exact watermarked cpy tat te uyer receves.Hence seer cannt create dupcates f

EKtern /py

If

. e

has bo t h e ysnrvp

0'

k

o n l

se

3

:�

-

t

� a

:

�

�

s

�

�

:

:

:

:

77

cyp

w i h

h

dt h

id g

kvn

rgil cv Im

ig. 2. Sprbl rvribl dt hidig with thr .

+

Kd ta

pa y

la

2014 Inteational Conference on Issues and Challenges in Intelligent Computing Techniques (ICICT)



he ora coe coa he ber waermark. However, case he seer ds a ahorzed co, he ca de he ber om whom hs ahorzed co has oraed.The waermark embedd rooco s based o bc kecrorah ad has e overhead erms o he oa daacommcaed bewee he ber ad he seer. Ths schemeaso saed he coce o hd he daa ecred orm o he daa. Here seer s do daa (err/Waermark hs case) embedd whe he does o kow he ora daacoe hs vsbe waermark. The ora daa coe

s he ecred orm 7.os o he work o reversbe daa hd ocses o he

daa embedd/exrac o he a saa doma. B some acaos s mora o aed some addoamessae wh he ecred mae however daa hder does o ow he ora mae coe. Ad s aso execed ha he ora coe shod be recovered who a erroraer mae decro ad messae exraco a recever sde.I eads o he sro secr based reversbe daa hd ha shod work ecro-decro doma.

Reerece 3 oered a racca scheme sas he above-meoed reremes. A coe ower ecrs he ora cover mae s a ecro ke ad a daahder cod embed addoa daa o he ecred mae

s a daa-hd ke ahoh he does o kow heora coe. Hav a ecred mae coaaddoa daa a recever rs decrs accord o heecro ke, ad he exracs he embedded daa adrecovers he ora mae accord o he daa-hd ke.I he scheme he rocedre o daa exraco s o searabeom he coe decro. I oher words, he rcacoe o ora mae s reveaed beore aoadexraco, ad, someoe has he daa-hd ke o b

o he ecro ke he s abe o exrac a ormaoom he ecred mae coa addoa daa 3.

IV. METHODOLOGY

I commo here are wo kds o reversbe daa hd eches (accord o ke dsrbo) searabe reversbe

daa hd eche ad o-searabe reversbe daa hd eche (aso caed as reversbe daa hd).As we ow searabe reversbe daa hd we are seara woacves .e. cover mae decro ad a oad daa

TABLE l

Sr.No.

2

3

4

ATA CAACITY TO MBD I TH IMAG AD LATDPSNR

Payload (In Approximate text PSNR of image

number of le size recovered after

words) (in )decrion in dB)

500 3.20 45.8573

1000 6.41 42.9012

1500 9.61 41.1306

2000 13.3 39.946

exraco. I addo o hs here are some rher ssesreaed wh exs searabe daa hd mehod.

The doma sed or daa hd hs ew aroach s based o a mae Ecro-Decro doma. Tha s hecover mae whch he secre daa s o be hde s ecredrs or make dsored. Ad he he daa hder comresses ha ecred verso o he cover mae o make a room oraddoa daa (Secred daa).

The secre daa whch s o be hde sed hs ewaroach s are eoh ex daa. Tabe I shows he how

mch ex ca be hd o he mae. For hese reasos smora o ake hese sses o cosderao.

As sho F., searabe scheme, he coe owerecrs he ora comressed mae s a ecroke o rodce a ecred mae. The s a daa-hdke he daa-hder comresses he eas sca bs (SB)o he ecred mae o creae some sace o accommodae he addoa daa. A he recever sde he daa embedded ca be eas rereved om he ecred mae coaaddoa daa accord o he daa-hd ke. Becase he

daa embedd o aecs he SB o he cover maedecro ma res a mae smar o he oraverso. Here a he recever sde here exss hree cases asshow F.2, case oe s whe he recever has o hedaa- hd ke, he s abe o exrac he addoa daa eve he does o ow he mae coe. Case wo s he haso he ecro ke, he ca decr he receved daa .e.ecred mae o oba a mae smar o he oracover meda, b cao exrac he embedded addoa daa.Case hree s he recever has boh he kes .e. daa-hdke ad he ecro ke, he ca exrac he addoa daaad recovers he ora mae who a error. Ths ewaroach o searabe reversbe daa hd mehod cossso hree ma rocedres,

A. Selecting the cover image and make it encpted

Hiding the data

ata extraction/image recove process

A. Selecting the cover image and make it encpted

Seec he arorae cover mae whch we wa o add he daa. The cover mae ca be o a orma ke , e, , , bm ec. Assme ha he xes o ora seecedmae s ra o 0,255 s rereseed b bs. Deoe hese bs o a xe as seve bs. Tha mes

hi.j.k,u lPi,j.2 U JId2 , 1 ,......7 (I)

ad

7

pi,j,k = Lbi,j,k." "(2)

=

I hs ecro hase, he excsve-or ress o heora bs ad sedo-radom bs are cacaed as

Bi,}, ,u bi,}, , ( ri,}, , (3)

Where ri,,k,u are deermed b a ecro ke s a

sadard sream cher.

Hiding the data

I hs se o daa embedd daa s covered o bar orm so ha bs o he daa .e.(c1I)(c12) (c18) (cn8) ca be embedded o

SB o he cover mae. Here he daa we embedded s ex so

c s se characer he ex ad en meas mbers ocharacers are here he ex. Aca he characers he ex are rereseed b her ASCII vae ad ha vae scovered o bar orma hs we e he bs o he ex.Accord o a daa-hd ke, he daa-hder radomseecs ecred xes. For each xe eas sca bsad dcae hem as i,},k,u where u 5678 hese are he

bs sed o carr he bs o he ex. Here aca reres wo xes o sore eh bs or se characer. Becase weare sor he ex bs o o SB o he mae xes haas or bs er xe hs case. ow reace he SB o

20J4 Inteationa Conference on Issues and Challenges in Intelligent Computing Techniques (ICICT) 773



andomy seected encypted pxes wth the ts of the text (eI)(e2) (e8) (cn8)

he emeddng ate a ato etween the data amont of net payoad and the tota nme of cove pxes s

ER=total no caacts n t txt(payload

()total_no_of _v _pxls

Data extraction/image recove process

In ths step we w consde the thee cases at the ecevesde that a eceve has the datahdng key ony the encyptonkey ony and oth the datahdng as we as encypton keys espectvey.

Case one s wth an encypted mage contanng theemedded data f the eceve nows ony a datahdng key hest get the vaes of the SB of the encypted magecontanng sece text. Now these ts contans the ts of the text so exact the two gop of SB of the mage pxe eachhavng fo ts then make a gop of eght ts .e. a yte thenconvet that yte nto eqvaent vae snce ths s the ASCIIvae of the chaacte of the text. nay tansfe that vaento eqvaent chaacte so that we get the compete text as astng.

Note that snce the andom pxe seecton any attackewthot the knowedge datahdng key cannot otan thevaes and the statstcs aot pxegops fo that eason hecannot extact the emedded data. themoe whe the eceve havng the datahdng key can sccessy extact theemedded data he s nae get any nfomaton aot theogna mage content.

Consde the second case n whch the eceve has theencypton key t does not now the datahdng key. Ceayhe cannot extact the emedded data. Bt the ogna magecontent can e oghy ecoveed at the eceve. Denotng the ts of pxes n the mage contanng emedded data as

B'i,,k,B'i,kIB'i,,k,2 B'i,,k,7 the eceve can decypt the eceved data

h'i,j,k, ='i,j,k, i,j,k, (5)Snce the dataemeddng opeaton does not ate any

MSB of encypted mage the decypted MSB mst e same as the ogna MSB. So the content of decypted mage s sma to that of ogna cove mage. he Mean Sqae o fo thatdecypted mage s

(6)

Whee D s the dffeence of ogna cove mage contansand the decypted cove mage contans.So the vae of PSNR n the decty decypted mage s

SNR=20g«255 MS (7)Consde the thd case n whch the eceve has oth the

datahdng and the encypton keys he may am to extact theemedded data .e. text and ecove the ogna mage. Heeaccodng to the datahdng key the eceve st get the vaesof the SB of the encypted mage contanng sece text snce the he pocede s same as n case one. Sma to the case two f the eceve has encypton key he can easy get theogna cove mage.

V. VALUATION METHODOLOGY

In ths new appoach we ae concentatng on how the pefomance of the cent scheme can e nceased yconsdeng few sses ke

A.Increase the amount of data to be hidehe pesent scope of the technqe s that the atho n

has sggested the method of sepaae evese data hdngwhen the amont of sece data s not too age. Sze of the

data mst e sma. So we need sch appoach whch wovecome ths sze mtaton. Hee n poposed system we ae tyng to emed age amont of data nto encypted veson of the cove mage. By osevng ae 1 t s cea that the poposed sepaae scheme can hande enogh data fosecty.

Getting higher PSNR of the decpted version of the coverimagehe poposed scheme's man advantage s that we ecove

the ogna cove mage sccessy wthot eo and havngmnmm o zeo dstoton. Hee we ae nteested n PSNRof the decypted cove mage ae pefomng encyptondecypton data hdng and data extactng pocess. As shown

n g. 3 t s cea that thee s vey negge oss ndecypted mage snce we get the hgh PSNR vaes. How theqaty s mantaned even ae pefomng encyptondecypton data hdng and data extactng pocess on themage s shown n g. 3.

60

_ P SNR of dc

d ig

50

4

<;

3

0

:

(

20

1

0

0

0 0.05 0 1 0

15 02 0 25

E rt

Fig. 3. Achieving higher PSNR of decrypted version of the cover image.

5Ornge jpg

1

�

-L na jg99

• eaves

jpg

9

a 98

-

" 98

.

; 97

97

96

46

0

8 46 8

4

embedded rate

Fig. 4. Observing high quality index.

77 2014 Inteational Conference on Issues and Challenges in Intelligent Computing Techniques (ICICT)



Obseing high quali index.The normal range of universal quality index is -1 to

I.Higher quality index hints to better quality. t is observedthat we get the unit quality index for various possible

embedded rate and for various images as shown in Fig. 4.1t

also shows how the quality index ranges om 098 to l00 .So it is concluded that the quality is not compromising in any way.

CONLUSION

The main objective of this study is to describe the conceptof separable reversible data hiding using new approach. This new approach describes how we can maintain the performanceaer increasing the amount of payload. So aer studying this novel technique it has been concluded that it is possible to hideenough or large amount of data without compromising securityas well as quality of the cover image. n this scheme we are notdegrading the quality of the cover media as we get the unitquality index of original cover image and the image aerencryption-decryption, data hiding process. Also higher PSNRof the decrypted cover image is observed aer performingencrption-decryption, data hiding and data extracting process

on cover image. Still there can be more ture aspects in this

scheme. Sometime the secure data can be in any form rathethan text for example an image. So in such situation we wihave to hide an image data into cover image.

EFERENES

[] Z. Ni, Y.-Q. Shi, N. nsari, and W. Su, "Reversible data hiding, ETrans. ircuits Syst. Video Techno!., vo!' 16, no. 3, pp. 354362Mar.2006.

[ 2] J. Tian, "Reversible data embedding using a dierence expansion

IEEE Trans. ircuits Syst. Video Techno!., vo!' 13, no. 8, pp. 89089Aug. 2003.

[3] Zhang, "Reversible data hiding in encrypted image, EE SignaProcess. Lett., vo!. 18, no. 4, pp. 255258, Apr. 20 .

[ 4] X ag "Sepaabe evebe Data Hdg cypted ageIEEE transactions on information forensics and security, vo!. 7, no. pp. 826832,Apr.2012.

[5] M. Johnson, P. Ishwar, V. M. Prabhakaran, D. Schonberg, and KRamchandran, "On compressing encrypted data, EE Trans. SignProcess., vo!. 52, no. 10, pp. 29923006, Oct. 2004.

[6] W. Liu, W. Zeng, L. Dong, and Q. Yao, "Efcient compression oencrypted grayscale images, EE Trans. Image Process., vol. 19, no 4,pp. 10971102, Apr. 2010.

[7] N. Memon and P. W. Wong, "A buyer-seller watermarking protocolIEEE Trans. Image Process., vo!. 10, no. 4, pp. 643649, Apr. 2001.

20J4 Inteationa Conference on Issues and Challenges in Intelligent Computing Techniques (ICICT) 775

A Novel Approach to Separable Reversible Data Hiding

Documents

Transcript of A Novel Approach to Separable Reversible Data Hiding