Robust and Progressive Color Image Visual Secret Sharing Cooperated with Data Hiding - PowerPoint PPT Presentation

1 / 20
About This Presentation
Title:

Robust and Progressive Color Image Visual Secret Sharing Cooperated with Data Hiding

Description:

Robust and Progressive Color Image Visual Secret Sharing Cooperated with Data Hiding Source 8th International Conference on Intelligent Systems – PowerPoint PPT presentation

Number of Views:180
Avg rating:3.0/5.0
Slides: 21
Provided by: pil81
Category:

less

Transcript and Presenter's Notes

Title: Robust and Progressive Color Image Visual Secret Sharing Cooperated with Data Hiding


1
Robust and Progressive Color Image Visual Secret
Sharing Cooperated with Data Hiding
  • Source 8th International Conference on
    Intelligent Systems
  • Design and Applications, Vol. 3,
    pp. 431-436AuthorsHao Luo, Faxin Yu,
    Jeng-Shyang Pan and Zhe-Ming Lu
  • SpeakerWei-Chiang Kao
  • Date 2009/04/22

2
Outline
  • Introduction
  • Visual secret sharing
  • Proposed scheme
  • Experimental result
  • Conclusions

3
Introduction(1/5)
  • Visual secret sharing scheme, Naor and Shamir
    (1994)

Secret
Share
Encoding
Secret image 256256 pixels
4
Introduction(2/5)
  • t out of n (t, n)
  • tRecipient needs t share images to retrieve the
    secret.
  • nSecret is hidden into n share images.
  • (2, 2)

5
Introduction(3/5)
Secret image 256256 pixels
  • Constructing rules of (2, 2)-VSS scheme

6
Introduction(4/5)
  • An example of the (2, 2)-VSS scheme

Randomly choose?
7
Introduction(5/5)
  • Constructing rules of non-expansible image size
    (2, 2)-VSS scheme

8
Proposed Scheme (1/9)
Secret image S
Halftone image H
Transition image construction T
Non-expansion VSS encryption
Shares S1, S2
Encryption diagram
9
Proposed Scheme (2/9)
173 168
155 90
79 9
111 23
173 168
155 90
79 9
111 23
44 56
10 25
125 166
160 37
44 56
10 25
125 166
160 37
R channel
sb
1 1
1 0
0 0
0 0
1 1
1 0
0 0
0 0
Secret image
0 0
0 0
0 1
1 0
0 0
0 0
0 1
1 0
Halftone
hb
10
Proposed Scheme (3/9)
173 168
155 90
44 56
10 25
79 9
111 23
125 166
160 37
173 168
155 90
44 56
10 25
79 9
111 23
125 166
160 37
sb1
sb2
sb3
sb4
Change
K
PRNG
order
psb1
psb2
psb3
psb4
11
Proposed Scheme (4/9)
125 01111101(2)
125 166
160 37
sign1,2 1
d1,2 125-166 00101001(2)
psb1
sign1,3 1
d1,3 125-160 00100011(2)
sign1,4 0
d1,4 125-37 01011000(2)
101011
Key image
K
001101
(¼ secret image pixels)
0 1 1 1 1 1 0 1 1 0 0 1
0 1 1 0 0 1 0 0 0 0 1 0 1 1 1
-------------------- 12 bits --------------------
-
-------------------------- 15 bits
---------------------------
12
Proposed Scheme (5/9)
1 1
1 0
0 0
0 0
0 1 1 1 1 1 0 1 1 0 0 1
0 0
0 0
0 1
1 0
hb
0 1
1 1
1 1
1 1
Transition image T
16-bit binary string s
0 1
1 0
0 1
0 1
13
Proposed Scheme (6/9)
16-bit binary string s
0 1 1 1 1 1 1 1 0 1 0 1 1 0 0 1
15-bit binary string w
0 1 1 0 0 1 0 0 0 0 1 0 1 1 1
Random select

S1
1
1
1
Combine these results to get the two shares of R
channel
0
1

XOR
0
1
Combine R, G, B channels to get the final shares

S2
1
0
14
Proposed Scheme (7/9)
Shares S1, S2
Level 1 decryption
Stacking
Level 2 decryption
S1 XOR S2
Transition image reconstruction T
Level 3 decryption
Decryption diagram
15
Proposed Scheme (8/9)
1 1 1 1 0 1 1 0 1 1 0 1 0 0 1 0
1 0 0 0 1 0 0 1 1 0 0 0 1 0 1 1
Share 1
Share 2
1 1 1 1 0 1 1 0 1 1 0 1 0 0 1 0

XOR
1 0 0 0 1 0 0 1 1 0 0 0 1 0 1 1
s
0 1 1 1 1 1 1 1 0 1 0 1 1 0 0 1
w
0 1 1 0 0 1 0 0 0 0 1 0 1 1 1
16
Proposed Scheme (9/9)
s
0 1 1 1 1 1 1 1 0 1 0 1 1 0 0 1
w
0 1 1 0 0 1 0 0 0 0 1 0 1 1 1
0 1 1 0 0 1 0 0 0 0 1 0 1 1 1
0 1 1 1 1 1 0 1 1 0 0 1
Using the first 26 bits to reconstuct psb1
Using all of the last one bit can reconstruct the
key image
125 165
157 37
101011
001101
psb1
K
Using K and PRNG can recover the order of psb1
to reconstruct the secret image
17
Experimental result (1/4)
Original halftone image
Original secret image
Original key image
S1
S2
S1 stacking S2
18
Experimental result (2/4)
Reconstructed halftone image
Reconstructed key image
Reconstructed secret image
19
Experimental result (3/4)
Original halftone image
Original secret image
Original key image
S1
S2
S1 stacking S2
20
Conclusions
  • A robust and progressive visual secret sharing
    scheme
  • The key not need to pre-sharing
Write a Comment
User Comments (0)
About PowerShow.com