为解决云存储系统中数据安全性问题,利用精确再生码构造一种新的(t,n)门限秘密共享方案.方案由子秘密的分发、原始秘密的恢复和子秘密丢失者的数据重建共3种算法组成.子秘密的分发就是将原始秘密先进行分块,再进行纠删编码,最后按一定的规则将编码后的数据块分发给n个分享者.选取t个分享者提供的数据块,按纠删码的译码算法恢复原始秘密.选取t个以上分享者的数据块,按精确再生码的译码算法重建出子秘密丢失者的数据.研究结果表明:访方案是一种信息论安全的门限体制,与传统的基于Lagrange多项式插值算法的秘密共享方案相比,具有运算复杂性低、节点存储量小、丢失子秘密易再生等优点.%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.
展开▼
