Computer Science – Cryptography and Security
Scientific paper
2009-01-29
4th Annual Computer Science Research Conference at the University of Oklahoma, April 18, 2009
Computer Science
Cryptography and Security
5 pages; with corrections
Scientific paper
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.
Kak Subhash
Parakh Abhishek
No associations
LandOfFree
Space Efficient Secret Sharing does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Space Efficient Secret Sharing, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Space Efficient Secret Sharing will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-424180