Preprint Article Version 1 This version is not peer-reviewed

Survey for Exploring Blockchain with Graph Neural Network

Version 1 : Received: 29 September 2024 / Approved: 30 September 2024 / Online: 30 September 2024 (07:47:29 CEST)

How to cite: Hasebe, A. Survey for Exploring Blockchain with Graph Neural Network. Preprints 2024, 2024092362. https://doi.org/10.20944/preprints202409.2362.v1 Hasebe, A. Survey for Exploring Blockchain with Graph Neural Network. Preprints 2024, 2024092362. https://doi.org/10.20944/preprints202409.2362.v1

Abstract

This paper explores the use of GNN architectures, including Graph Convolutional Networks (GCNs), Graph Attention Networks (GATs), and GraphSAGE, in modeling blockchain data. A specific focus is given to their applications in cryptocurrency transaction networks, where GNNs can detect fraudulent activities and track illicit fund flows by learning from transaction patterns and network structure. Additionally, future directions for GNN research in blockchain are discussed, including scalability challenges, privacy-preserving models, and multi-chain graph analysis. Through these advancements, GNNs offer significant potential for enhancing the security, transparency, and efficiency of blockchain and cryptocurrency ecosystems. This paper also shows an example of fraud detection for Ethereum cryptocurrencies.

Keywords

Graph Neural Network; Graph Convolutional Networks; Graph Attention Networks; blockchain; cryptocurrency

Subject

Computer Science and Mathematics, Artificial Intelligence and Machine Learning

Comments (0)

We encourage comments and feedback from a broad range of readers. See criteria for comments and our Diversity statement.

Leave a public comment
Send a private comment to the author(s)
* All users must log in before leaving a comment
Views 0
Downloads 0
Comments 0


×
Alerts
Notify me about updates to this article or when a peer-reviewed version is published.
We use cookies on our website to ensure you get the best experience.
Read more about our cookies here.