中南大学学报（自然科学版）2017，Vol.48Issue(4)：984-989,6.DOI:10.11817/j.issn.1672-7207.2017.04.018
基于精确再生码的秘密共享方案
Secret sharing scheme based on exact regenerating codes
摘要
Abstract
In order to solve data security issues in cloud storage system, a new (t, n) threshold secret sharing scheme was constructed based on exact regenerating codes. The scheme was composed of three algorithms which were distribution of share secret, recovery of the original secret and data reconstruction of lost share secrets. Distribution of share secret means that original secret is firstly split into some pieces, then is erasured codes, and finally is distributed to n partners. Choosing data blocks provided by t partners, the original secret can be recovered through some decoding algorithms of erasure coding. Choosing more than t data blocks,the lost data of partner who losts his data can be reconstructed following decoding algorithm of exact regenerating codes. The results show that the scheme is an information theoretical secure threshold system. Compared with the traditional secret sharing scheme based on Lagrange polynomial interpolation algorithm, the scheme has the advantages of lower computation complexity, less nodes storage and easier regeneration of lost share secrets.关键词
再生码/纠删码/网络编码/秘密共享/云存储/分布式存储Key words
regenerating codes/erasure coding/network coding/secret sharing/cloud storage/distributed storage分类
信息技术与安全科学引用本文复制引用
宋海龙,王伟平..基于精确再生码的秘密共享方案[J].中南大学学报（自然科学版）,2017,48(4):984-989,6.基金项目
国家自然科学基金资助项目(61173169, 61363037) （61173169, 61363037）
湖南省教育厅科研资助项目(13C755)(Projects (61173169, 61363037) supported by the National Natural Science Foundation of China （13C755）
Project (13C755) supported by the Science Foundation of Education Department of Hunan Province) （13C755）
