We present a new secret sharing algorithm that provides the storage
efficiency of an Information Dispersal Algorithm (IDA) while providing perfect
secret sharing. We achieve this by mixing the input message with random bytes
generated using Repeatable Random Sequence Generator (RRSG). We also use the
data from the RRSG to provide random polynomial evaluation points and
optionally compute the polynomials on random isomorphic fields rather than a
single fixed field.

Go to Source of this post
Author Of this post: <a href="http://arxiv.org/find/cs/1/au:+Srinivasan_A/0/1/0/all/0/1">Arvind Srinivasan</a>, <a href="http://arxiv.org/find/cs/1/au:+Chan_C/0/1/0/all/0/1">Chien-Chung Chan</a>

By admin