Towards Effective Detection of Ponzi schemes on Ethereum with Contract Runtime Behavior Graph
Not on the map. Why?
Abstract (arXiv)
Ponzi schemes, a form of scam, have been discovered in Ethereum smart contracts in recent years, causing massive financial losses. Existing detection methods primarily focus on rule-based approaches and machine learning techniques that utilize static information as features. However, these methods have significant limitations. Rule-based approaches rely on pre-defined rules with limited capabilities and domain knowledge dependency. Using static information like opcodes for machine learning fails to effectively characterize Ponzi contracts, resulting in poor reliability and interpretability. Moreover, relying on static information like transactions for machine learning requires a certain number of transactions to achieve detection, which limits the scalability of detection and hinders the identification of 0-day Ponzi schemes. In this paper, we propose PonziGuard, an efficient Ponzi scheme detection approach based on contract runtime behavior. Inspired by the observation that a contract's runtime behavior is more effective in disguising Ponzi contracts from the innocent contracts, PonziGuard establishes a comprehensive graph representation called contract runtime behavior graph (CRBG), to accurately depict the behavior of Ponzi contracts. Furthermore, it formulates the detection process as a graph classification task on CRBG, enhancing its overall effectiveness. The experiment results show that PonziGuard surpasses the current state-of-the-art approaches in the ground-truth dataset. We applied PonziGuard to Ethereum Mainnet and demonstrated its effectiveness in real-world scenarios. Using PonziGuard, we identified 805 Ponzi contracts on Ethereum Mainnet, which have resulted in an estimated economic loss of 281,700 Ether or approximately 500 million USD. We also found 0-day Ponzi schemes in the recently deployed 10,000 smart contracts.
Key facts. Cited by 4 papers in the map (data through 13 Oct 2026). First posted on arXiv 3 Jun 2024.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2024: 3; 2025: 1.
4 papers.
- 2024An Efficient Privacy-aware Split Learning Framework for Satellite Communicationscited by 6
- 2025Rethinking Membership Inference Attacks Against Transfer Learningcited by 6
- 2024Privacy-preserving Universal Adversarial Defense for Black-box Modelscited by 3
- 2024HeteroSample: Meta-path Guided Sampling for Heterogeneous Graph Representation Learningcited by 0
- 2025Rethinking Membership Inference Attacks Against Transfer Learning20 Jan 2025
- 2024HeteroSample: Meta-path Guided Sampling for Heterogeneous Graph Representation Learning11 Nov 2024
- 2024An Efficient Privacy-aware Split Learning Framework for Satellite Communications13 Sep 2024
- 2024Privacy-preserving Universal Adversarial Defense for Black-box Models20 Aug 2024