A Secret Sharing Algorithm Based on Regenerating Codes

2013 ◽  
Vol 397-400 ◽  
pp. 2031-2036
Author(s):  
Shu Zhen Zhang ◽  
Hai Long Song
Keyword(s):  
Secret Sharing ◽  
Fault Tolerant ◽  
Distributed Storage ◽  
Threshold Scheme ◽  
Main Process ◽  
Erasure Coding ◽  
Secret Data ◽  
Computation Cost ◽  
Distributed Storage Systems ◽  
Regenerating Codes

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.

Tree-Structured Parallel Regeneration Based on Regenerating Codes for Multiple Data Losses in Distributed Storage Systems

2014 ◽  
Vol 918 ◽  
pp. 295-300
Author(s):  
Peng Fei You ◽  
Yu Xing Peng ◽  
Zhen Huang ◽  
Chang Jian Wang
Keyword(s):  
Storage Systems ◽  
Distributed Storage ◽  
Data Loss ◽  
Data Reliability ◽  
Data Redundancy ◽  
Regeneration Time ◽  
Multiple Data ◽  
Distributed Storage Systems ◽  
Regenerating Codes ◽  
Reliability And Availability

In distributed storage systems, erasure codes represent an attractive data redundancy solution which can provide the same reliability as replication requiring much less storage space. Multiple data losses happens usually and the lost data should be regenerated to maintain data redundancy in distributed storage systems. Regeneration for multiple data losses is expected to be finished as soon as possible, because the regeneration time can influence the data reliability and availability of distributed storage systems. However, multiple data losses is usually regenerated by regenerating single data loss one by one, which brings high entire regeneration time and severely reduces the data reliability and availability of distributed storage systems. In this paper, we propose a tree-structured parallel regeneration scheme based on regenerating codes (TPRORC) for multiple data losses in distributed storage systems. In our scheme, multiple regeneration trees based on regenerating code are constructed. Firstly, these trees are created independently, each of which dose not share any edges from the others and is responsible for one data loss; secondly, every regeneration tree based on regenerating codes owns the least network traffic and bandwidth optimized-paths for regenerating its data loss. Thus it can perform parallel regeneration for multiple data losses by using multiple optimized topology trees, in which network bandwidth is utilized efficiently and entire regeneration is overlapped. Our simulation results show that the tree-structured parallel regeneration scheme reduces the regeneration time significantly, compared to other regular regeneration schemes.

scholarly journals Threshold-Based Post-Quantum Secure Verifiable Multi-Secret Sharing for Distributed Storage Blockchain

Mathematics ◽  
2020 ◽  
Vol 8 (12) ◽  
pp. 2218
Author(s):  
Sihem Mesnager ◽  
Ahmet Sınak ◽  
Oğuz Yayla
Keyword(s):  
Secret Sharing ◽  
Distributed Storage ◽  
Data Block ◽  
Threshold Scheme ◽  
Secret Key ◽  
Diverse Range ◽  
Transaction Data ◽  
Reed Solomon Code ◽  
Verification Process ◽  
Multi Secret Sharing

Blockchain systems store transaction data in the form of a distributed ledger where each node stores a copy of all data, which gives rise to storage issues. It is well-known that the tremendous storage and distribution of the block data are common problems in blockchain systems. In the literature, some types of secret sharing schemes are employed to overcome these problems. The secret sharing method is one of the most significant cryptographic protocols used to ensure the privacy of the data. The main purpose of this paper is to improve the recent distributed storage blockchain systems by proposing an alternative secret sharing method. We first propose a secure threshold verifiable multi-secret sharing scheme that has the verification and private communication steps based on post-quantum lattice-based hard problems. We then apply the proposed threshold scheme to the distributed storage blockchain (DSB) system to share transaction data at each block. In the proposed DSB system, we encrypt the data block with the AES-256 encryption algorithm before distributing it among nodes at each block, and both its secret key and the hash value of the block are privately shared among nodes simultaneously by the proposed scheme. Thereafter, in the DSB system, the encrypted data block is encoded by the Reed–Solomon code, and it is shared among nodes. We finally analyze the storage and recovery communication costs and the robustness of the proposed DSB system. We observe that our approach improves effectively the recovery communication cost and makes it more robust compared to the previous DSB systems. It also improves extremely the storage cost of the traditional blockchain systems. Furthermore, the proposed scheme brings to the DSB system the desirable properties such as verification process and secret communication without private channels in addition to the known properties of the schemes used in the previous DSB systems. As a result of the flexibility on the threshold parameter of the scheme, a diverse range of qualified subsets of nodes in the DSB system can privately recover the secret values.

Cyclic Structure in Regenerating Codes

2014 ◽  
Vol 539 ◽  
pp. 416-419
Author(s):  
Wen Juan Liang ◽  
Ying Du
Keyword(s):  
Storage Systems ◽  
Distributed Storage ◽  
Erasure Codes ◽  
Cyclic Structure ◽  
Distributed Storage Systems ◽  
Regenerating Codes ◽  
Original Message

Regenerating codes are a class of erasure codes for distributed storage. The use of regenerating codes not only improves reliability of distributed storage systems, but also minimizes repairing bandwidth when storage nodes failed and need to be repaired. In this paper, we investigate the cyclic structure of hybrid regenerating codes which each node has two fragments with the first fragment stores original message and the second fragment stores parity message. A fast repairing algorithm is also proposed.

Sign in / Sign up

Export Citation Format

Share Document