A Novel Secret Sharing Scheme Based on Minimal Linear Codes

摘要：

　　In this paper, we propose a novel space efficient secret sharing scheme on the basis of minimal linear codes, which satisfies the definition of a computationally efficient secret sharing scheme.In the scheme, we partition the underlying minimal linear code into disjoint classes, establishing a one-to-one correspondence between the minimal authorized subsets of participants and the representative codewords of all different classes.Each participant,with only one short share transmitted through a public channel,can share a large secret.Therefore, the proposed scheme can distribute a large secret in practical applications such as secure information dispersal in sensor networks and secure multiparty computation.

关键词： secret sharing scheme computationally efficient secret sharing minimal linear code access structure short share

作者: LI Zhihui SUN Jianhong LI Jing

作者单位: College of Mathematics and Information Science,Shaanxi Normal University,Xi”an 710062,Shaanxi,China

会议类型: 国内会议

会议名称: 第七届中国可信计算与信息安全学术会议

会议地点: 秦皇岛

会议语种:英文

页码: 407-412

在线出版日期: 2013-09-01（万方平台首次上网日期，不代表论文的发表时间）