Efficient Local Secret Sharing for Distributed Blockchain Systems

Kim, Yongjune; Raman, Ravi Kiran; Kim, Young‐Sik; Varshney, Lav R.; Shanbhag, Naresh R.

doi:10.1109/lcomm.2018.2886016

Cited by 35 publications

(23 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Compared to the traditional blockchain, our proposed scheme can effectively reduce the storage cost by 1/t, so the storage cost becomes (log 2 η + log 2 q)/t. From Table 1, it is clear that our proposed scheme is more efficient than other prior work including Kim et al's [6]. is can effectively reduce the deployment and maintenance cost in blockchain.…”

Section: Storage Costmentioning

confidence: 85%

“…(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%

“…is is effectively smaller compared to the traditional blockchain. Kim et al [6] proposed the LSS scheme to further reduce the storage cost to log 2 η t + log 2 q.…”

Section: Storage Costmentioning

confidence: 99%

“…In this way, the storage of a blockchain is reduced significantly. Later, Kim et al [6] improved DSB by proposing a local secret-sharing (LSS) scheme, which can tolerate single peer failure.…”

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: Storage Costmentioning

confidence: 85%

Section: Recovery Communication Costmentioning

confidence: 90%

“…is is effectively smaller compared to the traditional blockchain. Kim et al [6] proposed the LSS scheme to further reduce the storage cost to log 2 η t + log 2 q.…”

Section: Storage Costmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%