Take the 2-minute tour ×  I have been trying to understand how
secret sharing methods like Shamir's secret sharing solve the
problem of a share revealing information about the secret. I
guess there are some random numbers involved, but how is it done
mathematically?  share|improve this question can u be more clear
on , what is share revealing ? partial key exposure problem ?
AFAIK , there is no random value addition –  sashank Nov 12 '13
at 4:31 We have a pretty nice tag wiki for the shamir-secret-
sharing tag. (At least, I think so -- I wrote it.) It may
explain some of the issues you're asking about. If there's still
something you don't understand, you may want to edit your
question to make it more specific. –  Ilmari Karonen Nov 12 '13
at 11:07  2 Answers 2  Shamir's secret sharing is based on
mathematical splitting but not string splitting (as in
programming languages) . So a key share cannot be considered
same as partial key . Also the security is information-theoretic
but not computational meaning no amo