Implementing Secret Sharing Scheme in Parallel

The aim of a (k, n) threshold secret sharing scheme is to encrypt a secret s into n parts (called shares) such that any k participants can recover s using their shares, while any group of less than k ones cannot. To deal with multimedia data, the efficiency of sharing/decoding s becomes a major problem. Following the previous research in [3], we designed efficient implementations on Shamir's threshold secret sharing scheme on GPU in parallel. Experimental results show that GPU could achieve an appealing speedup over CPU when dealing with the sharing of multimedia data.