A Secret Sharing Algorithm Based on Regenerating Codes

Shu Zhen Zhang; Hai Long Song

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

Paper Titles

Improved Binary Tree Search Anti-Collision Algorithm
p.2012

Research on Digital I/O Modules Based on Bluetooth Communication
p.2019

FPGA Implementation of a Novel Multi-Rate QC-LDPC Encoder for DTMB Standard
p.2024

All-Optical Wavelength Conversion Based on XPM in HNLF
p.2028

A Secret Sharing Algorithm Based on Regenerating Codes
p.2031

A Mental Clustering Algorithm Based on the Embedded Agent in Wireless Sensor Network
p.2037

A Polling Control Protocol with Energy-Saving for Wireless Sensor Network
p.2042

RSSI Based Monte-Carlo Localization Boxed Algorithm
p.2048

The Design of MMS and SMS Student Service System Based on PC
p.2052

HomeApplied Mechanics and MaterialsApplied Mechanics and Materials Vols. 397-400A Secret Sharing Algorithm Based on Regenerating...

A Secret Sharing Algorithm Based on Regenerating Codes

Abstract:

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.

You might also be interested in these eBooks

Advanced Design and Manufacturing Technology III

View Preview

Info:

Periodical:

Applied Mechanics and Materials (Volumes 397-400)

Pages:

2031-2036

DOI:

https://doi.org/10.4028/www.scientific.net/AMM.397-400.2031

Citation:

Cite this paper

Online since:

September 2013

Authors:

Shu Zhen Zhang, Hai Long Song

Keywords:

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

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

References

[1] A. Shamir: Communications of the ACM. Vol. 22 (1979), p.612.

Google Scholar

[2] G. R. Blakley: Proceedings of AFIPS 1979 Nat Computer Conference. Vol. 48 (1979), p.313.

Google Scholar

[3] A. Beimel, B. Chor: Advances in Cryptology-CRYPTO '95, LNCS 963 (Springer-Verlag, Berlin 1995).

Google Scholar

[4] Pieprzyk J., X.M. Zhang: Discrete Mathematics & Theoretical Computer Science. Vol. 6(2)(2010), p.253.

Google Scholar

[5] Y.B. Guo, Ma JF: ACTA Electronica Sinica. Vol. 32(3) (2004), p.399.

Google Scholar

[6] A. G. Dimakis, P. B. Godfrey, Y. Wu, M. Wainwright, and K. Ramchan-dran: IEEE Trans. On Information Theory. Vol. 56 (2010), p.1524.

Google Scholar

[7] R. Ahlswede, N. Cai, S. -Y. R. Li, and R. W. Yeung: IEEE Trans. on Information Theory. Vol. 46 (2000), p.1204.

Google Scholar

[8] C. Asmuth and J. Bloom: IEEE Trans. on Information Theory. Vol. 20 (1983), p.208.

Google Scholar

[9] E.D. Karnin, J.W. Greene, and M.E. Hellan: IEEE Trans. on Information Theory. Vol. 29 (1983), p.35.

Google Scholar

[10] Y. J. Wang, W. D. Sun and S. Zhou: Journal of Software. Vol. 23 (2012), p.962.

Google Scholar

[11] X. M Wang, G.Z. Xiao, in: Error Correcting Code-principle and Method(revised edition), edited by Xi'an University of Electronic Science and Technology Publishers, Xi'an (2002).

Google Scholar

[12] J. Pieprzyk: Ideal threshold schemes from MDS codes. Proceedings of the 5th International Conference on Information Security and Cryptology. (Springer-Verlag, Berlin 2003).

DOI: 10.1007/3-540-36552-4_18

Google Scholar