In cryptography, secret sharing [1]}, [2]} refers to the process of splitting a secret among \(n\)  parties such that each party does not learn anything about the whole secret from the share it holds. The secret can be reconstructed only if a certain minimum number of parties, greater than or equal to a threshold, \(t\) , combine their shares. The scheme is known as the \((t,n)\)  threshold scheme or \(t\) -out-\(n\)  secret sharing. In this work, we use additive secret sharing, which uses addition as the way to combine shares. We use the notation \([a]_j\)  to denote the \(j^{th}\)  share of a secret \(a\) .
