Nearly optimal robust secret sharing

We prove that a known general approach to improve Shamir’s celebrated secret sharing scheme; i.e., adding an information-theoretic authentication tag to the secret, can make it robust for n parties against any collusion of size δ n , for any constant δ ∈ ( 0 , 1 / 2 ) . Shamir’s original scheme is r...

Full description