Implications of dissemination strategies on the security of distributed ledgers

  title={Implications of dissemination strategies on the security of distributed ledgers},
  author={Luca Serena and Gabriele D’angelo and Stefano Ferretti},
  journal={Proceedings of the 3rd Workshop on Cryptocurrencies and Blockchains for Distributed Systems},
This paper describes a simulation study on security attacks over Distributed Ledger Technologies (DLTs). We specifically focus on attacks at the underlying peer-to-peer layer of these systems, that is in charge of disseminating messages containing data and transaction to be spread among all participants. In particular, we consider the Sybil attack, according to which a malicious node creates many Sybils that drop messages coming from a specific attacked node, or even all messages from honest… 

Figures from this paper

Simulation of Dissemination Strategies on Temporal Networks
The experiments show that some gossip protocols allow to either save a considerable number of messages or to provide better anonymity guarantees, at the cost of a little lower coverage achieved and/or a little increase of the delivery time.
Simulation of Hybrid Edge Computing Architectures
This paper proposes a solution that combines the edge computing paradigm with a decentralized communication approach based on Peer-to-Peer (P2P) to outsource part of the traffic management from the Cloud servers to end-devices.
Using Probabilistic Methods in the Analysis of Information Security of Distributed Ledger Systems
  • K. Pankov, E. Saksonov
  • Computer Science, Mathematics
    2021 Systems of Signals Generating and Processing in the Field of on Board Communications
  • 2021
In this paper, using probabilistic methods of the queuing theory for blockchain-based distributed ledger systems mathematical models are constructed that allow calculating a number of characteristics


The Sybil Attack
It is shown that, without a logically centralized authority, Sybil attacks are always possible except under extreme and unrealistic assumptions of resource parity and coordination among entities.
Highly intensive data dissemination in complex networks
Eclipse Attacks on Bitcoin's Peer-to-Peer Network
This work takes a detailed look at bitcoin's peer-to-peer network, and quantifies the resources involved in the attack via probabilistic analysis, Monte Carlo simulations, measurements and experiments with live bitcoin nodes.
Dandelion++: Lightweight Cryptocurrency Networking with Formal Anonymity Guarantees
This work presents Dandelion++, a first-principles defense against large-scale deanonymization attacks with near-optimal information-theoretic guarantees, and evaluates it through experiments on Bitcoin's mainnet to demonstrate its interoperability and low broadcast latency overhead.
Agent-based Simulation of Blockchains
LUNES-Blockchain is described, an agent-based simulator of blockchains that is able to exploit Parallel and Distributed Simulation (PADS) techniques to offer a high level of scalability and study the effect of a security attack on the consensus protocol.
Deanonymization and Linkability of Cryptocurrency Transactions Based on Network Analysis
  • A. Biryukov, S. Tikhomirov
  • Computer Science, Mathematics
    2019 IEEE European Symposium on Security and Privacy (EuroS&P)
  • 2019
It is argued that timings of transaction messages leak information about their origin, which can be exploited by a well connected adversarial node, and a novel technique for linking transactions based on transaction propagation analysis is proposed.
Decentralization in Bitcoin and Ethereum Networks
The extent of decentralization is investigated by measuring the network resources of nodes and the interconnection among them, the protocol requirements affecting the operation of nodes, and the robustness of the two systems against attacks.
Dandelion: Redesigning the Bitcoin Network for Anonymity
In this context, egalitarianism means that no single party wields disproportionate power over the network's operation, and transparency means that all transactions are verified and recorded with cryptographic integrity guarantees; this prevents fraudulent activity like double-spending of money.
Nodes in the Bitcoin Network: Comparative Measurement Study and Survey
This paper measures and analyzes how many the so-called “volunteers” are in the Bitcoin P2P network by scanning the live Bitcoin network for 37 days in 2018 and proposes a simple distance-based peer selection rule for improved connectivity and faster data propagation.
Comparative analysis of blockchain consensus algorithms
  • L. Bach, B. Mihaljevic, M. Zagar
  • Computer Science, Mathematics
    2018 41st International Convention on Information and Communication Technology, Electronics and Microelectronics (MIPRO)
  • 2018
A comparative analysis of typical consensus algorithms and some of their contemporaries that are currently in use in modern blockchains is performed, focusing on the algorithmic steps taken, the scalability of the algorithm, the method the algorithm rewards validators for their time spent verifying blocks, and the security risks present within the algorithm.