Shamir’s Secret Sharing Scheme in Parallel
A (k, n) threshold secret sharing scheme encrypts a secret s into n parts (called shares), which are distributed into n participants, such that any k participants can recover s using their shares, any group of less than k ones cannot. When the size of s grows large (e.g. multimedia data), the efficiency of sharing/decoding s becomes a major problem. We designed efficient and parallel implementations on Shamir’s threshold secret sharing scheme using sequential CPU and parallel GPU platforms, respectively, in a personal computer. Experimental results show that GPU could achieve an appealing speedup over CPU when dealing with the sharing of multimedia data.
KeywordsSecret sharing Threshold scheme Parallel computing
- 2.Fang, W.-P.: Parallel processing for secret image sharing. In: International Symposium on Parallel and Distributed, IEEE Proceeding on Processing with Applications (ISPA10), Taipei, Taiwan, pp. 392–396 (2010)Google Scholar
- 3.Nvidia, Cuda GPUs. https://developer.nvidia.com/cuda-gpus
- 4.Nvidia, Cuda Zone. https://developer.nvidia.com/cuda-zone
- 5.Stallings, W.: Cryptography and Network Security Principles and Practices, 4th edn. Prentice Hall, Upper Saddle River (2005)Google Scholar