February 19, 2002
Practical Aspects of Modern Cryptography
10
Secret Sharing –
AND
n
Let
z
Î
Z
n
= {0,1,…,m-1}
be a secret value to be
shared with Alice and Bob.
n
Randomly and uniformly select values
x
and
y
from
Z
m
subject to the constraint that
n
(
x
+
y
) mod
m
=
z
.