You are looking at a specific version 20090727:041539 of this paper. See the latest version.

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 efficiencysecret sharingrecursion
Contact author(s)
parakh @ okstate edu
History
2009-07-27: received
Short URL
https://ia.cr/2009/365
License
Creative Commons Attribution
CC BY
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.