Lecture Outline

The Problem
The B/T (OR) Solution
The B/R/T (Cover) Solution
The Problem - Demonstration
2 out of 2 demo
The B/T (Or) Solution
Uses Black/Transparent transparencies.
Reconstruction is done by stacking.
Each party (out of n) receives a single
transparency.
Implementation
Pixels are split:
m
n shares per pixel:
m
n
Share 1
Share 2
Share n
Pixel Subpixels
Stacking & Contrast
m
m
: V
H(V)
H(V) > m
B

H(V) s m
W

m
W
< m
B
contrast = (m
B
-m
W
)/m
2 out of 2
Horizontal shares Vertical shares Diagonal shares
Security of 2 out of 2
( ) ( ) black original X share P white original X share P
6
1
= = = = = =
Generalization
A single share - row of m bits.
Shared pixel - nxm bit matrix.
A B/T sharing scheme:
Given a pixel, how should it be shared =
How to construct the matrix M.
Stacking transparencies - bitwise OR of rows
Formal
Contrast:
0 s m
W
< m
B
s m

For any authorized subset U of {1n} :
H(OR(M
U
)) s m
w
if M is a white matrix.
m
B
s H(OR(M
U
)) if M is a black matrix.
Security:
For any unauthorized subset U of {1n} :
( ) ( ) ( ) black original X M P white original X M P , Z X
U U m U 2
= = = = = e

3 out of 3
m = 4
White pixel - random column-permutation of:
(
(
(

0 1 1 0
1 0 1 0
1 1 0 0
Black pixel - random column-permutation of:
(
(
(

1 0 0 1
1 0 1 0
1 1 0 0
2 out of n
m = n
White pixel - a random column-permutation of:
Black pixel - a random column-permutation of:
(
(
(
(
(
(

0 0 0 1
0 0 0 1
0 0 0 1
0 0 0 1

(
(
(
(
(
(

1 0 0 0
0 1 0 0
0 0 1 0
0 0 0 1

k out of k
m = 2
k-1

White pixel:
A kx2
k-1
matrix, whose columns are all the bit
vectors of length k with even parity.
Black pixel - odd parity.
Bound on contrast
k out of k:

contrast s 1/2
k-1

m > 2
k-1
k out of n
Constructed from a k out of k scheme.
Assume: A uniform scheme
{ }
) U f( )) H(OR(M
1 k U 1 , n 1 U
U
=
s s _
Universal k-Family
A collection L of functions:
{1n}
{1k}
h
1
,h
2

( )
r
p r h(U) P = =
U
|U| = k
h
1
(U)
|h
1
(U)| = r
h
2
(U)
h
1
h
2
|h
2
(U)| = r
Parameters
m=m|L|
c=cp
k

Generation of a matrix
Create nxm matrices T
h
by mapping rows

(
(
(
(
(
(
(
(

0 1 0 1
1 1 1 1
0 1 0 1
1 1 1 1
1 1 0 0
n

T
1
h

(
(
(
(
(
(
(
(

0 1 1 0
0 1 0 0
1 0 0 1
1 0 1 0
1 0 1 0
n

T
2
h
For all h in L, create a kxm matrix T
h
1

(
(
(
(
(
(

0 0 1 0
1 1 1 1
1 1 0 0
0 1 0 1
k

T
1

h
2

(
(
(
(
(
(

1 0 1 0
0 1 1 0
1 0 0 1
0 1 0 0
k

T
2

Concatenate the matrices horizontally

(
(
(
(
(
(
(
(

0 1 1 0
0 1 0 0
1 0 0 1
1 0 1 0
1 0 1 0
0 1 0 1
1 1 1 1
0 1 0 1
1 1 1 1
1 1 0 0
n
k out of n (Security)
{ } k h(U) k U , n 1 U L, h < < _ e
{ }
( )
( ) ( )
( )
( ) ( )
( ) ( )
| | | | ( )
| | | | ( ) black original X X X T T T P
white original X X X T T T P
black original X T P black original X T P
white original X T P white original X T P
L h k U , n 1 U
U
h
l
h
2
h
1
U
h
l
h
2
h
1
U
h
l
h
2
h
1
U
h
l
h
2
h
1
U
h
U
h
U h U h
U h U h
U
h
U
h
l 2 1 l 2 1
l 2 1 l 2 1
= =
= = =

= = = = = =
= = = = = =
e < _

k out of n (Contrast)
{ } { }
r
p l r h(U) L h , k U , n 1 U = = e = _
{ }
( ) ( )
( ) ( ) ( )
( )
( )

)

= s
= >
< =
= _ e
white is T and k U h m
black is T and k U h m
k U h U h f
T OR H
k U , n 1 U , L h
W
B
U
h

{ } ( ) ( )
( )
( ) ( )
U h
U
h
T OR H T OR H n 1 U , L h = _ e
k out of n (Contrast)
( )
r
1 k
1 r
k B B
p l r f p l m m' + =

=
( )
r
1 k
1 r
k W W
p l r f p l m m' + =

=
( )
k
k W B
p contrast
m l
p l m m
contrast' =

=
The B/R/T (Cover) Solution
Uses Black/Red/Transparent pixels.
Reconstruction by merging.
Each party (out of 2) receives several
transparencies.
2 out of 2 demo
Implementation
Pixels are split:
Pixel Subpixels
m
c sheets:
m
c
Sheet 1
Sheet 2
Sheet c
Party I
Party II
Merging & Contrast
B(V)
B(V) > m
B

R(V) > m
R
m
R
+ m
B
> m

contrast = (m
B
+ m
R
)/m - 1
m
m
: V
Comparison
Much better contrast !!!
Less subpixels !!!
Cannot be used for k out of n, if k > 2.
Requires more sheets per person.
2 out of 2 Monochromatic
Red Pixel
8
7
6
5
4
3
2
1
8
7
6
5
4
3
2
1
Black Pixel
Party I
Party II
|
|
.
|

\
|
=
4 2 3 1
4 3 2 1

2 out of 2 Bichromatic
Party I
Party II
4
3
2
1
Red Pixel
4
3
2
1
Black Pixel
|
|
.
|

\
|
=
4 2 3 1
4 3 2 1

Generalization
Two distributions D
B
,D
R
on cxm matrices
over {B,R,T}
A partition of {1c} into S
I
,S
II
.

Formal
D
B
on S
I
= D
R
on S
I
(S
II
)
Cover operation reaches bound.
m
B
+m
R
>m. contrast = (m
B
+m
R
)/m 1 > 0