Let s be a secret that is L bits long.

Tom designed an (n,n) secret sharing scheme using the AND operation. It works in the following way:

• To share the secret, the dealer chooses n 1 uniformly random bit strings, d₁, ... ,d_n1, each d_i is L bits long. The dealer computes the last share d_n = s d₁ d₂ d_n1. The dealer gives d_i to the ith party.
• To reconstruct the secret, compute s' = d₁ d₂ d_n1 d_n

True/False, this AND based (n,n)-secret sharing scheme is correct, i.e. the secret can always be recovered?