scholarly journals Efficient Local Secret Sharing for Distributed Blockchain Systems

2021 ◽  
Vol 9 (VI) ◽  
pp. 2043-2048
Author(s):  
G. Latha
Keyword(s):  
Secret Sharing ◽  
Distributed Storage ◽  
Denial Of Service ◽  
Distributed Database ◽  
Storage Efficiency ◽  
Communication Costs ◽  
Transaction Data ◽  
Private Key ◽  
Information Dispersal ◽  
High Storage

Blockchain system store transaction data in the form of a distributed database where each peer is to maintain an identical copy. Blockchain systems resemble repetition codes, incurring high storage cost. Recently, distributed storage blockchain (DSB) systems have been proposed to improve storage efficiency by incorporating secret sharing, private key encryption, and information dispersal algorithms. However, the DSB results in significant communication cost when peer failures occur due to denial of service attacks. In this project, we propose a new DSB approach based on a local secret sharing (LSS) scheme with a hierarchical secret structure of one global secret node and several local secret nodes. The proposed DSB approach with LSS improves the storage and recovery communication costs.

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.

scholarly journals CBase-EC: Achieving Optimal Throughput-Storage Efficiency Trade-Off Using Erasure Codes

Electronics ◽  
2021 ◽  
Vol 10 (2) ◽  
pp. 126
Author(s):  
Chuqiao Xiao ◽  
Yefeng Xia ◽  
Qian Zhang ◽  
Xueqing Gong ◽  
Liyan Zhu
Keyword(s):  
Distributed Storage ◽  
Data Access ◽  
Database Systems ◽  
Distributed Database ◽  
Transaction Processing ◽  
Recognition Algorithm ◽  
Erasure Codes ◽  
Storage Efficiency ◽  
Distributed Storage Systems ◽  
Processing And Storage

Many distributed database systems that guarantee high concurrency and scalability adopt read-write separation architecture. Simultaneously, these systems need to store massive amounts of data daily, requiring different mechanisms for storing and accessing data, such as hot and cold data access strategies. Unlike distributed storage systems, the distributed database splits a table into sub-tables or shards, and the request frequency of each sub-table is not the same within a specific time. Therefore, it is not only necessary to design hot-to-cold approaches to reduce storage overhead, but also cold-to-hot methods to ensure high concurrency of those systems. We present a new redundant strategy named CBase-EC, using erasure codes to trade the performances of transaction processing and storage efficiency for CBase database systems developed for financial scenarios of the Bank. Two algorithms are proposed: the hot-cold tablets (shards) recognition algorithm and the hot-cold dynamic conversion algorithm. Then we adopt two optimization approaches to improve CBase-EC performance. In the experiment, we compare CBase-EC with three-replicas in CBase. The experimental results show that although the transaction processing performance declined by no more than 6%, the storage efficiency increased by 18.4%.

scholarly journals A Consortium Blockchain Wallet Scheme Based on Dual-Threshold Key Sharing

Symmetry ◽  
2021 ◽  
Vol 13 (8) ◽  
pp. 1444
Author(s):  
Guojia Li ◽  
Lin You
Keyword(s):  
Secret Sharing ◽  
Important Data ◽  
Private Key ◽  
Digital Assets

In recent years, blockchain has triggered an upsurge in the application of decentralized models and has received more and more attention. For convenience and security considerations, in blockchain applications, users usually use wallets to manage digital assets. The most important data stored in the wallet is the user’s private key, which is also the only identification of the ownership of the encrypted digital assets. Once the private key is lost or stolen, it will bring irreparable losses. We proposed a consortium blockchain wallet scheme based on dual-threshold key protection secret-sharing. By splitting and storing the user’s wallet private key using a secret-sharing method, we can protect our private keys safely and effectively. Our scheme is based on the application scenario of the consortium blockchain. The peers preset by the consortium blockchain store the user’s wallet private key shadow shares, reasonably integrate storage resources, and enhance the solution’s anti-attack ability by setting double thresholds.

scholarly journals A Hierarchical Key Management Scheme in Mobile Ad hoc Networks

2011 ◽  
Vol 1 ◽  
pp. 295-299
Author(s):  
Jun Wu ◽  
Run Hua Shi ◽  
Hong Zhong
Keyword(s):  
Ad Hoc Networks ◽  
Mobile Ad Hoc Networks ◽  
Secret Sharing ◽  
Key Management ◽  
Ad Hoc ◽  
Private Key ◽  
Management Scheme ◽  
Mobile Ad Hoc ◽  
Hoc Networks ◽  
Key Management Scheme

This paper proposes a hierarchical key management scheme in the mobile Ad hoc networks. In this scheme, there are two kinds of server nodes: the special server nodes and the ordinary server nodes, such that only when two kinds of server nodes collaborate can they provide a certificate service. In order to satisfy this special application, we design a new secret sharing scheme for splitting the system private key, in which it generates two different kinds of shares of the system private key: the special share and the ordinary share, where it needs at least one special share and t ordinary shares to recover the system private key, thus we call it threshold scheme. Furthermore, we present a distributed signature scheme for a user’s certificate in the mobile Ad hoc networks based on this secret sharing.

scholarly journals P2P Payment using Blockchain Technology

2021 ◽  
pp. 12-16
Author(s):  
Savinay Mengi ◽  
Astha Gupta
Keyword(s):  
Distributed Control ◽  
Distributed Database ◽  
Economic Incentives ◽  
P2p Network ◽  
The Internet ◽  
P2p Networks ◽  
Transaction Data ◽  
Blockchain Technology ◽  
Single User ◽  
Human Problem

A Blockchain protocol operates on top of the Internet, on a P2P network of computers that all run the protocol and hold an identical copy of the ledger of transactions, enabling P2P value transactions without a middleman though machine consensus. The concept of Blockchain first came to fame in October 2008, as part of a proposal for Bitcoin, with the aim to create P2P money without banks. Bitcoin introduced a novel solution to the age-old human problem of trust. The underlying blockchain technology allows us to trust the outputs of the system without trusting any actor within it. People and institutions who do not know or trust each other, reside in different countries, are subject to different jurisdictions, and who have no legally binding agreements with each other, can now interact over the Internet without the need for trusted third parties like banks, Internet platforms, or other types of clearing institutions. Ideas around cryptographically secured P2P networks have been discussed in the academic environment in different evolutionary stages, mostly in theoretical papers, since the 1980s. “Proof-of-Work” is the consensus mechanism that enables distributed control over the ledger. It is based on a combination of economic incentives and cryptography. Blockchain is a shared, trusted, public ledger of transactions, that everyone can inspect but which no single user controls. It is a distributed database that maintains a continuously growing list of transaction data records, cryptographically secured from tampering and revision.

Data Replication Impact on DDBS System Performance

2019 ◽  
pp. 134-162 ◽  
Author(s):  
Ali A. Amer
Keyword(s):  
System Performance ◽  
Data Distribution ◽  
Evaluation Process ◽  
Data Replication ◽  
Database Systems ◽  
Distributed Database ◽  
Communication Costs ◽  
Distributed Database Systems ◽  
Data Fragmentation ◽  
Heuristic Clustering

In distributed database systems (DDBS), the utmost purpose of data distribution and replication aims at shrinking transmission costs (TC), including communication costs, and response time. In this chapter, therefore, an enhanced heuristic clustering-based technique for data fragmentation and replicated based allocation is efficaciously presented. This work is mainly sought to further enhance an existing technique so TC is to be significantly minimized. In fact, the approached enhancement is applied by suggesting different replication scenarios. Off these scenarios, one scenario is to be selected based on competitive performance evaluation process. DDBS performance is measured via its being exposed on objective function (TC). Despite the fact that this work is mildly improved, yet evaluation results show that it has been promising, particularly as TC being the foremost design objective of DDBS System. Experimental results have been analyzed under all presented scenarios as an internal evaluation and are vividly provided to demonstrate the undeniable impact of data replication on DDBS performance.

scholarly journals Coherent Optical Memory with High Storage Efficiency and Large Fractional Delay

2013 ◽  
Vol 110 (8) ◽  
Author(s):  
Yi-Hsin Chen ◽  
Meng-Jung Lee ◽  
I-Chung Wang ◽  
Shengwang Du ◽  
Yong-Fan Chen ◽  
...  
Keyword(s):  
Optical Memory ◽  
Storage Efficiency ◽  
Fractional Delay ◽  
High Storage
Sign in / Sign up

Export Citation Format

Share Document