Short Secret Sharing Using Repeatable Random Sequence Generators
This work addresses the need for efficient and secure secret sharing in cryptography, though it appears incremental as it builds on existing concepts like IDA and RRSG.
The paper tackles the problem of achieving both storage efficiency and perfect secrecy in secret sharing by introducing a new algorithm that mixes input messages with random bytes from Repeatable Random Sequence Generators (RRSG), resulting in a method that combines the benefits of Information Dispersal Algorithms with perfect secret sharing.
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.