Preventing 51% Attack by Using Consecutive Block Limits in Bitcoin

• Main Authors: Babur, Sohail Mahmood, Khan, Shafiq Ur Rehman, Yang, Jing, Chen, Yen-Lin, Ku, Chin Soon, Por, Lip Yee
• Format: Article
• Published: Institute of Electrical and Electronics Engineers 2024
• Subjects: QA75 Electronic computers. Computer science
• Online Access: http://eprints.um.edu.my/45839/; https://doi.org/10.1109/ACCESS.2024.3407521
• Institution: Universiti Malaya

In permissionless blockchain systems, Proof of Work (PoW) is utilized to address the issues of double-spending and transaction starvation. When an attacker acquires more than 50% of the hash power of the entire network, they gain the ability to engage in double-spending activities, posing a significant threat to the PoW consensus algorithm. This research focuses on the consensus algorithm employed in the Bitcoin system, explaining how it operates and the security challenges it faces. The proposed modification to the PoW algorithm imposes a restriction on miners: they are not allowed to accept consecutive blocks from the same miner into the final local blockchain to prevent the 51% attack problem. This modification supports transactions that require six confirmations. In the event an attacker attempts a 51% attack with a private chain that consists of fewer than 6 blocks, it becomes easier to detect a double-spending attack before accepting the attacker's private chain. The modified algorithm introduces a ``Safe Mode Detection Algorithm'' that scrutinizes incoming blocks for adjustments at the top of the local blockchain. If inconsistencies are identified, the consensus algorithm proceeds cautiously by comparing the UTXO dictionaries from the attacker's chain with those from the miner's own blockchain. This meticulous comparison aims to detect instances of double-spending. If such instances are detected, the miner rejects the attacker's chain, establishing a double-spend-free environment and thwarting 51% attacks.