Welcome to the resource topic for 2009/365
Title:
Space Efficient Secret Sharing: A Recursive Approach
Authors: Abhishek Parakh, 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.
ePrint: https://eprint.iacr.org/2009/365
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .