Almost-perfect secret sharing

Details Almost-perfect secret sharing Almost-perfect secret sharing

2011-03-13

arxiv.org/abs/1103.2544v3

Computer Science

Information Theory

Acknowledgments added

Scientific paper

Splitting a secret s between several participants, we generate (for each value of s) shares for all participants. The goal: authorized groups of participants should be able to reconstruct the secret but forbidden ones get no information about it. In this paper we introduce several notions of non- perfect secret sharing, where some small information leak is permitted. We study its relation to the Kolmogorov complexity version of secret sharing (establishing some connection in both directions) and the effects of changing the secret size (showing that we can decrease the size of the secret and the information leak at the same time).

Affiliated with

Also associated with

No associations

Rating

Almost-perfect 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 Almost-perfect secret sharing, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Almost-perfect secret sharing will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-234052