1 / 13

A Secret Image Sharing Scheme Based on Vector Quantization Mechanism

A Secret Image Sharing Scheme Based on Vector Quantization Mechanism. Source : Embedded and Ubiquitous Computing - the 2006 IFIP International Conference on Embedded And Ubiquitous Computing (EUC'2006) Author : Chin-Chen Chang , Chi-Shiang Chan and Yi-Hsuan Fan. Outline.

neilp
Download Presentation

A Secret Image Sharing Scheme Based on Vector Quantization Mechanism

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 Secret Image Sharing Scheme Based on Vector Quantization Mechanism Source : Embedded and Ubiquitous Computing - the 2006 IFIP International Conference on Embedded And Ubiquitous Computing (EUC'2006) Author : Chin-Chen Chang , Chi-Shiang Chanand Yi-Hsuan Fan

  2. Outline • The ( t, n) threshold scheme • The secret image sharing method • The proposed method

  3. Create a r-1 degree polynomial f(x) where ai-1,ai-2…, a1 are randomly chosen and P is prime number. The ( r, n) threshold scheme • Divide secret key K into n shadows. • The secret key K can’t be revealed without r or more shadows. n shadows: f(1), f(2), …, f(n)

  4. f(x)=2x+3 mod 11 y f(x) (3,9) (1,5) (2,7) f(0)=3 x The ( t, n) threshold scheme Ex: (2,3) threshold system (The secret key K =3) 3 shadows: (1,5), (2,7), (3,9)

  5. The Related Method--The secret image sharing method 1. The sharing phase 2. Reveal phase 3. The lossless secret image sharing method

  6. The sharing phase-- (2,3) threshold system Step 1. Permute image

  7. 2 3 3 6 7 13 12 7 3 2 14 13 3 4 6 1 15 14 30 120 5 7 3 9 5 220 230 220 9 100 140 200 4 2 3 2 3 0 3 2 4 6 2 2 2 3 6 4 3 2 0 4 5 11 5 6 3 6 3 6 0 253 4 250 1. The sharing phase -- (2,3) threshold system

  8. 5 200 230 220 f(x)=2x+3 mod 251 3 0 3 2 2 3 6 4 3 shadows: (1,5), (2,7), (3,9) 5 11 5 6 1. The sharing phase -- (2,3) threshold system Step 2.Truncate gray values larger than 250 to 250. Step 3.Construct r-1 polynomial. 2 3 3 6 7 13 12 7 3 2 14 13 3 4 6 1 15 14 30 120 5 7 3 9 9 100 140 200 4 2 3 2 4 6 2 2 3 2 0 4 3 6 3 6 0 250 4 250

  9. 5 7 9 1. The sharing phase -- (2,3) threshold system 3 shadows: (1,5), (2,7), (3,9) Shadow images 1 Shadow images 2 Shadow images 3

  10. (1,5), (2,7) 5 20 20 24 3 10 3 2 Reconstruct f(x) : f(x)=2x+3 mod 251 12 3 16 4 5 11 15 6 2. Reveal phase Shadow images 1 Shadow images 2 5 3 3 16 7 113 12 7 3 2 14 13 3 4 6 1 15 14 30 12 5 7 3 9 19 10 14 25 4 2 3 2 14 6 2 2 11 2 10 4 3 6 13 6 10 3 4 4

  11. 2 3 2. Reveal phase Revealed image Reconstruct f(x) : f(x)=2x+3 mod 251

  12. Step 2.Partition Cover Images Cover Image B Cover image C Cover Image A (a0,a1) Index: I2 =3 Index: I3 =7 Step 4.Index: I1 =10 6 10 9 6 Step 3. f(x)= a0+a1x= 6+10x mod 257 13 4 15 6 Step 6. Shadows Values:f(I1)= 106, f(I2)= 36, f(I3)= 76 Step 1. The Permuted Indexed Image 17 10 8 2 Step 7. Embed into Blocks 12 11 14 1 Shadow image C Shadow image A Shadow image B

  13. Step 2.Partition Cover Images Cover Image B Cover image C Cover Image A (a0,a1) Index: I2 =3 Index: I3 =7 Step 4.Index: I1 =10 6 10 9 6 Step 3. f(x)= a0+a1x= 9+6x mod 257 13 4 15 6 Step 6. Shadows Values:f(I1)= 69, f(I2)= 27, f(I3)= 51 Step 1. The Permuted Indexed Image 17 10 8 2 12 11 14 1 Step 7. Embed into Blocks Shadow image C Shadow image A Shadow image B

More Related