(N,1)-(N, N scheme (N, 1: Make N copies of the secret and give each user a copy (N, N): Let s be the secret, let M be a large number Let s, s,,, sx be n random numbers such that s;+S2+…S= s mod m Assign s; to the ith user6 (N,1) - (N,N) scheme • (N,1) :Make N copies of the secret and give each user a copy • (N,N) :Let s be the secret, let M be a large number Let s1 , s2 ,…, sN be N random numbers such that s1+ s2+…+ sN = s mod M Assign si to the ith user