Space Efficient Secret Sharing
Cryptography and Security
2010-01-11 v2
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.
Keywords
Cite
@article{arxiv.0901.4798,
title = {Space Efficient Secret Sharing},
author = {Abhishek Parakh and Subhash Kak},
journal= {arXiv preprint arXiv:0901.4798},
year = {2010}
}
Comments
5 pages; with corrections