DONS: Dynamic Optimized Neighbor Selection for smart blockchain networks

Baniata, Hamza; Anaqreh, Ahmad T.; Kertész, Attila

doi:10.1016/j.future.2021.12.010

Cited by 17 publications

(10 citation statements)

References 31 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The trade-off between scalability and security in sharded public BCs is an open optimization problem [101]. The utilization of a TTP further deviates the system towards centralization, while the utilization of a leader election raises identity privacy concerns [85]. Decentralization and Privacy were among the few core issues that Bitcoin primarily attempted to solve.…”

Section: Experiments and Discussionmentioning

confidence: 99%

See 1 more Smart Citation

Bitcoin Revisited: Formalization, Benchmarking, and Open Security Issues

Baniata¹,

Kertész²

2022

Preprint

Self Cite

View full text Add to dashboard Cite

<p>Thousands of researchers and practitioners around the world neglect foundational understanding of the most trusted cryptocurrency platform, Bitcoin. According to the typical tendency of taking the discussion of Bitcoin's security for granted, it is usually confidently stated that, technically, Bitcoin is one of the most secure platforms for investment. In this paper, we revisit the fundamental calculations and assumptions of this widely adopted platform. We break down the original calculations in order to better understand the underlying assumptions of the Bitcoin proposal. Accordingly, we set open research questions, and we highlight expected scenarios upon the violation of each assumption. Furthermore, we propose a novel formalization of the Bitcoin mining problem using the Birthday Paradox, which we utilize to propose new concepts for benchmarking the security of Bitcoin, including the Critical Difficulty and Critical Difficulty per given portion. Our calculations indicated that it would be profitable to launch Partial Pre-Image attacks on Bitcoin once the mining puzzle difficulty reaches 56 leading zeros. Additionally, we discuss how Quantum Computing can be used to attack Bitcoin, and the implications of Sharding on the security of Bitcoin. The main objective of this work is to highlight, demystify, and justify the confusion between the realistic relative trust versus the common unconditional trust in Bitcoin.</p>

show abstract

Section: Experiments and Discussionmentioning

confidence: 99%

“…Although it is hard to address, once addressed in public permissionless BCs either privacy violations, or very high complexities are usually expected [85]. Even if agreed-on to be used, incentivization mechanisms need to be implemented, and high complexity issues must be solved.…”

Section: Decentralizationmentioning

confidence: 99%

Bitcoin Revisited: Formalization, Benchmarking, and Open Security Issues

Baniata¹,

Kertész²

2022

Preprint

Self Cite

View full text Add to dashboard Cite

show abstract

“…Therefore, research consideration should be given to multiple controllers to help the network scale up. Baniata et al [84] used a hybrid architecture to manage the P2P network of blockchain, as shown in Figure 8. One peer is voted into a leadership role to take charge of topology management.…”

Section: P2p Topology Optimizationmentioning

confidence: 99%

“…However, this approach has significant network management overhead and does not easily lend itself to a dynamic reconfiguration. Therefore, to make P2P management more flexible and minimize its management overhead, researchers could consider developing intelligent semi-distributed techniques [84] to manage the P2P of blockchain networks. Thus, some peers in the blockchain are assigned special responsibilities.…”

Section: Gap Analysismentioning

confidence: 99%

A Survey on Network Optimization Techniques for Blockchain Systems

et al. 2022

View full text Add to dashboard Cite

The increase of the Internet of Things (IoT) calls for secure solutions for industrial applications. The security of IoT can be potentially improved by blockchain. However, blockchain technology suffers scalability issues which hinders integration with IoT. Solutions to blockchain’s scalability issues, such as minimizing the computational complexity of consensus algorithms or blockchain storage requirements, have received attention. However, to realize the full potential of blockchain in IoT, the inefficiencies of its inter-peer communication must also be addressed. For example, blockchain uses a flooding technique to share blocks, resulting in duplicates and inefficient bandwidth usage. Moreover, blockchain peers use a random neighbor selection (RNS) technique to decide on other peers with whom to exchange blockchain data. As a result, the peer-to-peer (P2P) topology formation limits the effective achievable throughput. This paper provides a survey on the state-of-the-art network structures and communication mechanisms used in blockchain and establishes the need for network-based optimization. Additionally, it discusses the blockchain architecture and its layers categorizes existing literature into the layers and provides a survey on the state-of-the-art optimization frameworks, analyzing their effectiveness and ability to scale. Finally, this paper presents recommendations for future work.

show abstract

“…There is another approach that uses a minimum spanning tree (MST) for the neighbor selection [33]. In that method, a leader node in a blockchain network creates an MST in the network by taking all the network edge costs into consideration.…”

Section: Related Workmentioning

confidence: 99%

New Neighbor Selection Method for Blockchain Network With Multiple Regions

Goto

Sao²

2022

IEEE Access

View full text Add to dashboard Cite

One of the features of the Bitcoin network today is that its participating nodes are located in different regions of the world. Generally, inter-region data transmission is relatively time-consuming compared with intra-region data transmission. Thus, an important challenge for a blockchain network is shortening the block propagation time in order to reduce forks and maintain fairness, i.e., similar mining durations, for all miners. Previous methods have tried to increase the block propagation speed at the expense of imposing a higher burden on each node and a higher risk of eclipse attack. This paper proposes a new neighbor selection method that is based on only the neighbor's regional information and assumes that a node has a relatively small number of neighbors located outside its region. By using this simple method, the distribution of blocks throughout the network becomes faster and the random neighbor-selection nature of the blockchain network is kept intact; thus, risk of an eclipse attack is low. This paper also proposes a block propagation model over multiple regions for exploring the theoretical reasons for the effectiveness of the proposed neighbor selection method. Finally, it examines a migration scenario to the proposed method from the default neighbor selection method implemented in Bitcoin nodes, and evaluates the migration effects in various sizes of networks.

show abstract

DONS: Dynamic Optimized Neighbor Selection for smart blockchain networks

Cited by 17 publications

References 31 publications

Bitcoin Revisited: Formalization, Benchmarking, and Open Security Issues

Bitcoin Revisited: Formalization, Benchmarking, and Open Security Issues

A Survey on Network Optimization Techniques for Blockchain Systems

New Neighbor Selection Method for Blockchain Network With Multiple Regions

Contact Info

Product

Resources

About