Consider a t$-$out$-$of$-$n threshold secret sharing scheme with messages l bits long and where each user$$s share is also a string of bits. Prove that if the scheme is secure$,$ then every user$$s share must be at least l bits long.