Date Added: Dec 2011
The authors present a (n,n) secret sharing scheme whose security can be reduced to the hardness of the Learning With Errors (LWE) problem. This is a strong property since the LWE problem is believed to be very hard, as hard as worst-case lattice problems hence offering security in the quantum world. The scheme has certain technical advantages: it requires only basic operations and it allows sharing several secrets at the same time. A secret sharing scheme is a cryptographic primitive that allows a secret to be shared among a set of participants such that only a qualified subset (or even the whole set) can recover the secret.