February 19, 2002
Practical Aspects of Modern Cryptography
12
Secret Sharing –
AND
n
This trick easily generalizes to more
than two shareholders.
n
n
A secret S can be written as
n
S = (
s
1
+
s
2
+ … +
s
n
) mod
m
n
for any randomly chosen integer values
s
1
,
s
2
, …,
s
n
in the range
0
≤
s
i
<
m
.