A New Attack Method for Malicious Nodes in Tangle Network

Abstract

As a blockchain in the field of Internet of Things, Tangle network has received extensive attention from academia and industry. The Tangle network forms a distributed ledger structure through a Directed Acyclic Graph (DAG). Malicious nodes try to achieve the purpose of attack by preventing consensus or reducing the efficiency of consensus. Fast Probabilistic Consensus (FPC) is an important method for the Tangle network to deal with malicious nodes. However, FPC did not consider the situation in which nodes not affected by the attacking node reached a consensus. Based on this situation, this article proposes a new possible attack strategy and defense strategy. The attacking node balances the proportional relationship between the attacked node and the unattended node, and makes a malicious answer close to 1:1, thereby affecting the consensus. This article simulates the realization of this attack method and proposes a defense strategy.