1 / 15

A Secure Data Hiding Scheme for Binary Images

A Secure Data Hiding Scheme for Binary Images. Author : Yu-Chee Tseng, Yu-Yuan Chen and Hsiang-Kuang Pan Source : IEEE Transactions on Communications, Vol.50, No.8, August 2003, pp. 1227-1231 Adviser: Chin-Chen Chang Speaker: Z.Y.Wu( 吳紫嫣 ) Date : 2005/06/21. Outline. Introduction

couto
Download Presentation

A Secure Data Hiding Scheme for Binary Images

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. A Secure Data Hiding Scheme for Binary Images Author : Yu-Chee Tseng, Yu-Yuan Chen and Hsiang-Kuang Pan Source : IEEE Transactions on Communications, Vol.50, No.8, August 2003, pp. 1227-1231 Adviser: Chin-Chen Chang Speaker: Z.Y.Wu(吳紫嫣) Date : 2005/06/21

  2. Outline • Introduction • The Proposed Method • Experimental Results • Conclusions

  3. Introduction • Achieve confidentiality • encryption • steganography(data/information hiding) • Given an m*n image block, the proposed scheme can conceal as many as log2( m*n+1) bits of data in the block by changing, at most, two bits in the block.

  4. The Proposed Method(1/9) • F: a host binary image, size: multiple of m*n • Fi: the ith block in F • K: a secret key , size: m*n • W: a secret-weight matrix, size: m*n • r: the number of bits to be embedded in each m*n block of F, the value of r satisfies 2r-1  m*n • B: critical information consisting of kr bits to be embedded in F, where k is the number of m*n blocks in F.

  5. The Proposed Method(2/9) • Weight Management • To embed r = 2 bits of data in Fi.

  6. The Proposed Method(3/9) Embedded data: b1b2 

  7. The Proposed Method(4/9) • Example of host image F, secret key K, and weight matrix W. • F is partitioned into four 4*4 blocks F1…F4. • Let r =3, so we can embed 12 bits, B=001010000001

  8. 24 26 34 36 The Proposed Method(5/9) 1. 2.

  9. The Proposed Method(6/9) 3. 4.

  10. The Proposed Method(7/9) 4.1 Embedded data:001the weight must +1 or –7  4.2 Embedded data:010F2 does not need to be modified. 

  11. The Proposed Method(8/9) 4.3 Embedded data:000the weight must +6 or –2  4.2 Embedded data:001the weight must +5 or –3 

  12. The Proposed Method(9/9) 1 6 3 2

  13. Experimental Results(1/2) • Host binary image of size 256*256.

  14. Experimental Results(2/2) • 將256*256的原圖切成block size 8*8,共切成1024個blocks • 丟掉全黑跟全白8*8block,剩下846個blocks • weight martix 的 r =3 • 共藏入 846*3=2538 bits

  15. Conclusions • Embed more information • Higher security

More Related