New Approach Optimizes Share Size in Secret Sharing

🔑📉 New construction optimizes share size in computational secret sharing. A recent study presents a novel approach to (t,n)-threshold secret sharing, achieving a share size of |S| + |K|t, where |S| is the size of the secret and |K| is the size of the secret key. This construction improves upon previous methods that required a share size of |S|t + |K|. The authors demonstrate that, under certain assumptions regarding the encryption scheme—specifically, the non-compressibility of pseudorandom encryption and the non-redundancy of the secret key—this new share size is optimal. This advancement could enhance the efficiency of secret sharing protocols in computational security contexts.

Source

Original