Distributed Storage Meets Secret Sharing on the Blockchain

Raman, Ravi Kiran; Varshney, Lav R.

doi:10.1109/ita.2018.8503089

Cited by 45 publications

(38 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…e proposed scheme is able to reduce the storage cost of traditional blockchain by 1/t without introducing additional communication cost. It is also more efficient compared to the other recent studies [5,6] that attempted to solve the same problem. Although the scheme proposed by Dai et al [3] is as efficient as our proposed scheme, it leaks partial information and is considered less secure.…”

Section: Discussionmentioning

confidence: 92%

“…(10) Figure 5 shows the tradeoff between storage and recovery communication cost for a specific case. It is clearly shown that our proposed scheme can achieve lower storage cost but (1, 30), (2,10) (1, 5), (2,3), (3,21) (1, 2), (2,8), (3,24), (4,21) (1, 19), (2,10), (3,13), (4,26), (5,24), (6,21), (7,8) Security and Communication Networks does not increase the recovery communication cost. is is a huge advantage compared to original blockchain and the state-of-the-art work by Kim et al…”

Section: Recovery Communication Costmentioning

confidence: 90%

“…In regard to the robustness to peer failures, traditional blockchain can tolerate (n − 1) node failure, in the expense of large ledger stored in every node. e scheme proposed by Raman and Varshney [5] and Kim et al [6] can only tolerate (n/t + 1) − 1 and 2(n/t + 1) − 1 failures, respectively, which is significantly smaller than the traditional blockchain. Our proposed scheme can tolerate (n − t − 1) node failure, which is better compared to these two state-of-the-art schemes [5,6].…”

Section: Robustness To Peer Failuresmentioning

confidence: 99%

“…is eventually reduces the ability to perform a public audit, as some of the information is eventually erased. e idea of distributed storage blockchain (DSB) is first introduced by Raman and Varshney in 2018 [5]. e blockchain transaction block is first encrypted and then stored at different nodes (together with the encryption key) using a secret-sharing scheme.…”

Section: Introductionmentioning

confidence: 99%

“…In this paper, we improve existing work [3,5,6] by proposing a low-storage scheme with multisecret sharing based on polynomial interpolation. Our idea is different from Raman and Varshney [5] and Kim et al [6] as we do not encrypt the blockchain transaction block. Instead, our proposed scheme divides the blockchain transaction block directly into multiple shares and stores it in different nodes.…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

Light Repository Blockchain System with Multisecret Sharing for Industrial Big Data

Chen

Chang

et al. 2019

Security and Communication Networks

View full text Add to dashboard Cite

Blockchain is an emerging technology that promises many exciting applications in various elds, including nancial, medical, energy, and logistics management. However, there are still some limitations in the existing blockchain framework that prevents its widespread adoption in the commercial world. One important limitation is the storage requirement, wherein each blockchain node has to store a copy of the distributed ledger. us, as the number of transactions increases, this storage requirement grows quadratically, eventually limiting the scalability of a blockchain system. Moreover, the public ledger in a blockchain framework allows anyone in the network to audit the transaction, which may not be favourable in some privacy-sensitive applications. In this paper, a secret-sharing scheme is proposed to reduce the size of the blockchain transactions. Each transaction block is divided into t parts, and the size of each part is 1/t size of transaction block. We use the secret-sharing mechanism to share t parts into n shares. Hence, each node stores not one transaction but one share in the blockchain system. e proposed scheme can eventually reduce the storage cost of a blockchain transaction by 1/t without introducing an additional recovery communication cost; however, robustness is reduced in node failure as a tradeo . Meanwhile, the proposed scheme was more e cient and secure compared to other state-of-the-art schemes that aim to reduce blockchain storage for industrial big data.

show abstract

Section: Discussionmentioning

confidence: 92%