Accelerating Secret Sharing on GPU

Abstract

A (k, n) threshold secret sharing scheme encrypts a secret s into n parts (called shares), which are distributed to n participants, such that any k participants can recover s using their shares, any group of less than k ones cannot. A robust threshold sharing scheme provides not only the perfect security, but also the tolerance of a possible loss of up to n–k shares. When the size of s grows large (such as multimedia data), the efficiency of the encoding/decoding on s becomes a major problem. We designed efficient implementations for Kurihara et al.’s threshold secret sharing scheme on parallel GPU platforms in a personal computer. Experimental results show that the parallel GPU implementation could achieve an appealing speedup over the sequential CPU implementation when dealing with the sharing of multimedia data.

This research was supported in part by the Ministry of Science and Technology, Taiwan, under Grants MOST 103-2221-E-130-002-MY3 and 107-2221-E-130-016.