Space Efficient Secret Sharing: A Recursive Approach

Abhishek Parakh; Subhash Kak

Paper 2009/365

Space Efficient Secret Sharing: A Recursive Approach

Abhishek Parakh and Subhash Kak

Abstract

This paper presents a k-threshold 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 optimal bound of |S|/k, if the secret is to be recovered from k shares. The proposed scheme makes use of repeated polynomial interpolation. Our technique has potential applications in secure and reliable storage of information on the Web and in sensor networks.

Metadata

Available format(s): PDF
Publication info: Published elsewhere. Unknown where it was published
Keywords: space efficiency secret sharing recursion
Contact author(s): parakh @ okstate edu
History: 2009-07-27: received
Short URL: https://ia.cr/2009/365
License: CC BY

BibTeX

@misc{cryptoeprint:2009/365,
      author = {Abhishek Parakh and Subhash Kak},
      title = {Space Efficient Secret Sharing: A Recursive Approach},
      howpublished = {Cryptology {ePrint} Archive, Paper 2009/365},
      year = {2009},
      url = {https://eprint.iacr.org/2009/365}
}