arXiv · 0901.4798
Space Efficient Secret Sharing
Abstract
This note proposes a method of space efficient secret sharing in which k secrets are mapped into n shares (n>=k) of the same size. Since, n can be chosen to be equal to k, the method is space efficient. This method may be compared with conventional secret sharing schemes that divide a single secret into n shares.
Explore related subjects
Keep this discovery
Abhishek Parakh, Subhash Kak. 2009-02-18. Space Efficient Secret Sharing. https://arxiv.org/abs/0901.4798
Cite the original work for its findings. Save a collection to share your selection of sources.