Cryptology ePrint Archive: Report 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.

Category / Keywords: space efficiency, secret sharing, recursion

Date: received 21 Jul 2009

Contact author: parakh at okstate edu

Available format(s): PDF | BibTeX Citation

Version: 20090727:041539 (All versions of this report)

Short URL:

[ Cryptology ePrint archive ]