A Secret Sharing Algorithm Based on Regenerating Codes

被引：0

作者：

Zhang, Shu Zhen ^{[1
]}

Song, Hai Long ^{[1
]}

机构：

[1] Jishou Univ, Sch Informat Sci & Engn, Jishou 416000, Peoples R China

来源：

ADVANCED DESIGN AND MANUFACTURING TECHNOLOGY III, PTS 1-4 | 2013年 / 397-400卷

关键词：

Regenerating Codes; Erasure Coding; Network Coding; Secret Sharing; Distributed Storage;

D O I：

10.4028/www.scientific.net/AMM.397-400.2031

中图分类号：

TP39 [计算机的应用];

学科分类号：

081203 ; 0835 ;

摘要：

As a kind of special MDS erasure coding, regenerating codes are firstly used to solve the fault-tolerant problem in distributed storage systems. This paper constructs a new kind of secret sharing algorithm based on regenerating codes. The main process is that the original secret data is firstly stripped and coded with MDS erasure coding algorithm, then the vector components are periodically distributed to secret sharers in a certain order. The secret data can be rebuilt by decoding algorithm of regenerating codes if there are enough shares of the secret. Theoretical analysis shows that the algorithm is a safe threshold scheme. Because the operations are mainly linear on small finite field and its computation cost is low, so it is easy to realize.

引用

页码：2031 / 2036

页数：6

共 12 条

[1] Network information flow [J].

Ahlswede, R ;

Cai, N ;

Li, SYR ;

Yeung, RW .

IEEE TRANSACTIONS ON INFORMATION THEORY, 2000, 46 (04) :1204-1216

[2] A MODULAR APPROACH TO KEY SAFEGUARDING [J].

ASMUTH, C ;

BLOOM, J .

IEEE TRANSACTIONS ON INFORMATION THEORY, 1983, 29 (02) :208-210

[3]

Beimel A., 1995, LNCS, V963

[4] Order-Optimal Consensus Through Randomized Path Averaging [J].

Benezit, Florence ;

Dimakis, Alexandros G. ;

Thiran, Patrick ;

Vetterli, Martin .

IEEE TRANSACTIONS ON INFORMATION THEORY, 2010, 56 (10) :5150-5167

[5]

Blakley G. R., 1979, 1979 International Workshop on Managing Requirements Knowledge (MARK), P313, DOI 10.1109/MARK.1979.8817296

[6]

Guo Yuan-bo, 2004, Acta Electronica Sinica, V32, P399

[7] ON SECRET SHARING SYSTEMS [J].

KARNIN, ED ;

GREENE, JW ;

HELLMAN, ME .

IEEE TRANSACTIONS ON INFORMATION THEORY, 1983, 29 (01) :35-41

[8]

Pieprzyk J, 2004, DISCRETE MATH THEOR, V6, P253

[9]

Pieprzyk J., 2003, P 5 INT C INF SEC CR

[10] HOW TO SHARE A SECRET [J].

SHAMIR, A .

COMMUNICATIONS OF THE ACM, 1979, 22 (11) :612-613

← 1 2 →