Space efficient secret sharing for implicit data security

This paper presents a k-threshold computational secret sharing technique that distributes a secret S   into shares of size |S|k-1, where ∣S  ∣ denotes the secret size. This bound is close to the space optimal bound of |S|k if the secret is to be recovered from k shares. In other words, our technique can be looked upon as a new information dispersal scheme that provides near optimal space efficiency. The proposed scheme makes use of repeated polynomial interpolation and has potential applications in secure information dispersal on the Web and in sensor networks.