Implementing Secret Sharing Scheme in Parallel

被引：4

作者：

Shyu, Shyong Jian ^{[1
]}

Tsai, Ying Zhen ^{[1
]}

Tsai, Yin Te ^{[2
]}

机构：

[1] Ming Chuan Univ, Dept Comp Sci & Informat Engn, Taipei, Taiwan

[2] Providence Univ, Dept Comp Sci & Commun Engn, Taichung, Taiwan

来源：

2018 15TH INTERNATIONAL SYMPOSIUM ON PERVASIVE SYSTEMS, ALGORITHMS AND NETWORKS (I-SPAN 2018) | 2018年

关键词：

Secret sharing; Threshold scheme; Parallel computing;

D O I：

10.1109/I-SPAN.2018.00068

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

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.

引用

页码：362 / 365

页数：4