Space Efficient Secret Sharing: A Recursive Approach

Details Space Efficient Secret Sharing: A Recursive Approach Space Efficient Secret Sharing: A Recursive Approach

2009-01-30

arxiv.org/abs/0901.4814v1

Computer Science

Cryptography and Security

8 pages

Scientific paper

This paper presents a recursive secret sharing technique that distributes k-1 secrets of length b each into n shares such that each share is effectively of length (n/(k-1))*b and any k pieces suffice for reconstructing all the k-1 secrets. Since n/(k-1) is near the optimal factor of n/k, and can be chosen to be close to 1, the proposed technique is space efficient. Furthermore, each share is information theoretically secure, i.e. it does not depend on any unproven assumption of computational intractability. Such a recursive technique has potential applications in secure and reliable storage of information on the Web and in sensor networks.

Affiliated with

Also associated with

No associations

Rating

Space Efficient Secret Sharing: A Recursive Approach 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: A Recursive Approach, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Space Efficient Secret Sharing: A Recursive Approach will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-424389