Time-Restricted Double-Spending Attack on PoW-based Blockchains

arXiv:2402.17223v1 Announce Type: new
Abstract: Numerous blockchain applications are designed with tasks that naturally have finite durations, and hence, a double-spending attack (DSA) on such blockchain applications leans towards being conducted within a finite timeframe, specifically before the completion of their tasks. Furthermore, existing research suggests that practical attackers typically favor executing a DSA within a finite timeframe due to their limited computational resources. These observations serve as the impetus for this paper to investigate a time-restricted DSA (TR-DSA) model …

applications arxiv attack attackers blockchain blockchains cs.cr dsa pow research restricted spending