Accurate Decentralized Application Identification via Encrypted Traffic Analysis Using Graph Neural Networks
The DOI matches its Crossref record; 27 of the 27 references it cites were found in a registry or an index.
Abstract
Decentralized Applications (DApps) are increasingly developed and deployed on blockchain platforms such as Ethereum. DApp fingerprinting can identify users' visits to specific DApps by analyzing the resulting network traffic, revealing much sensitive information about the users, such as their real identities, financial conditions and religious or political preferences. DApps deployed on the same platform usually adopt the same communication interface and similar traffic encryption settings, making the resulting traffic less discriminative. Existing encrypted traffic classification methods either require hand-crafted and fine-tuning features or suffer from low accuracy. It remains a challenging task to conduct DApp fingerprinting in an accurate and efficient way. In this paper, we present GraphDApp, a novel DApp fingerprinting method using Graph Neural Networks (GNNs). We propose a graph structure named Traffic Interaction Graph (TIG) as an information-rich representation of encrypted DApp flows, which implicitly reserves multiple dimensional features in bidirectional client-server interactions. Using TIG, we turn DApp fingerprinting into a graph classification problem and design a powerful GNN-based classifier. We collect real-world traffic datasets from 1,300 DApps with more than 169,000 flows. The experimental results show that GraphDApp is superior to the other state-of-the-art methods in terms of classification accuracy in both closed- and open-world scenarios. In addition, GraphDApp maintains its high accuracy when being applied to the traditional mobile application classification.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Citations
Cites
Multilayer feedforward networks are universal approximators
Hornik, K., Stinchcombe, M., & White, H. (1989) · Neural Networks · doi:10.1016/0893-6080(89)90020-8 · Cited by 21,728 · cited 1×
“MLPs are able to model and learn f and ϕ in Theorem 1 according to the universal approximation theorem [13], [14].”
BackgroundMultilayer feedforward networks are universal approximators
HornikK., StinchcombeM., & WhiteH. (1989) · Neural Networks · doi:10.5555/70405.70408 · Cited by 9,081
Approximation capabilities of multilayer feedforward networks
Hornik, K. (1991) · Neural Networks · doi:10.1016/0893-6080(91)90009-t · Cited by 6,091
Formal Semantics for Kolmogorov-Arnold Network Representations of Operational Games
Zhukov, G. A. (2025) · Zenodo (CERN European Organization for Nuclear Research) · doi:10.5281/zenodo.15206559 · Cited by 3,212
Deep Learning for Encrypted Traffic Classification: An Overview
Rezaei, S., & Liu, X. (2019) · IEEE Communications Magazine · doi:10.1109/mcom.2019.1800819 · Cited by 670
Website Fingerprinting at Internet Scale
Panchenko, A., Lanze, F., Zinnen, A., Henze, M., Pennekamp, J., Wehrle, K., & Engel, T. (2016) · Proceedings 2016 Network and Distributed System Security Symposium · doi:10.14722/ndss.2016.23477 · Cited by 645 · cited 6×
“[17] leveraged the accumulated sum of packet lengths as features that were fed to a Support Vector Machine (SVM) classifier.”
BackgroundMethodInfluentialDeep Fingerprinting: Undermining Website Fingerprinting Defenses with Deep Learning
Sirinam, P., Imani, M., Juarez, M., & Wright, M. (2018) · Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security · doi:10.1145/3243734.3243768 · Cited by 592 · cited 6×
“been proposed for website fingerprinting [18], [26], mobile”
BackgroundInfluentialAn optimal lower bound on the number of variables for graph identification
Cai, J.-Y., F�rer, M., & Immerman, N. (1992) · Combinatorica · doi:10.1007/bf01305232 · Cited by 502
k-fingerprinting: a Robust Scalable Website Fingerprinting TechniquePreprint
Hayes, J., & Danezis, G. (2015) · arXiv (Cornell University) · doi:10.48550/arxiv.1509.00789 · Cited by 488
AppScanner: Automatic Fingerprinting of Smartphone Apps from Encrypted Network Traffic
Taylor, V. F., Spolaor, R., Conti, M., & Martinovic, I. (2016) · 2016 IEEE European Symposium on Security and Privacy (EuroS&P) · doi:10.1109/eurosp.2016.40 · Cited by 390
Research works printed but not linked: 4
- 2019, Matplotlib
- 2019, Countries and Territories
- 2019, State of the Dapps
- 2019, Ethereum
Cited by
Lin, X., Xiong, G., Gou, G., Li, Z., Shi, J., & Yu, J. (2022) · Proceedings of the ACM Web Conference 2022 · doi:10.1145/3485447.3512217 · Cited by 599
“We compare ET-BERT with various state-of-the-art (SOTA) meth-ods, including (1) fingerprint construction method: FlowPrint [37]; (2) statistical feature methods: AppScanner [36], CUMUL [27], BIND [1] andk-fingerprinting (K-fp) [12]; (3)deep learning methods: Deep Fingerprinting (DF) [35], FS-Net [22], GraphDApp [33],…”
MethodGraph-based deep learning for communication networks: A survey
Jiang, W. (2022) · Computer Communications · doi:10.1016/j.comcom.2021.12.015 · Cited by 284
“Blockchain Platform Encrypted Traffic Classification [35] GNN-based DApps Fingerprinting GIN [98]”
BackgroundMethodMachine Learning-Powered Encrypted Network Traffic Analysis: A Comprehensive Survey
Shen, M., Ye, K., Liu, X., Zhu, L., Kang, J., Yu, S., Li, Q., & Xu, K. (2023) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2022.3208196 · Cited by 265
“For flow-level representation, statistic features [66] are usually fed into traditional machine learning classi-fiers, while the sequence of directional packets, image-based abstraction [150], graph-based abstraction [69], frequency domain [204] are proposed to work with deep learning classi-fiers.”
BackgroundMethodInfluentialSelf-citationRealtime Robust Malicious Traffic Detection via Frequency Domain Analysis
Fu, C., Li, Q., Shen, M., & Xu, K. (2021) · Proceedings of the 2021 ACM SIGSAC Conference on Computer and Communications Security · doi:10.1145/3460120.3484585 · Cited by 223
Self-citationA Novel Approach to Large-Scale Dynamically Weighted Directed Network Representation
Luo, X., Wu, H., Wang, Z., Wang, J., & Meng, D. (2022) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2021.3132503 · Cited by 211
“Evidently, it contains rich knowledge demonstrating involved nodes’ behaviors [8], [9], [10].”
Background
Metadata
- Authors
- Shen, M., Zhang, J., Zhu, L., Xu, K., & Du, X.
- Affiliations
- Beijing Institute of Technology (CN)
- Peng Cheng Laboratory (CN)
- Temple University (US)
- Venue
- IEEE Transactions on Information Forensics and Security
- Published
- 2021
- Volume
- 16
- Pages
- 2367-2380
- ISSN
- 1556-6013 (ISSN-L)
- 1556-6021
- OpenAlex
- W3120227884
- Cited by
- 392
- References
- 27
- Citations by year
- 2026: 91 · 2025: 112 · 2024: 86 · 2023: 55 · 2022: 34 · 2021: 14
- FWCI
- 16.63
- Type
- journal article
- Language
- en
- Open access
- closed
- Licence
- Locations
- IEEE Transactions on Information Forensics and Security (publishedVersion)
- Funders
- National Key Research and Development Program of China (2020YFB1006101)
- Beijing Nova Program (Z201100006820006)
- NSFC Projects (61972039, 61932016, 61872041)
- Beijing Natural Science Foundation (4192050)
- Zhejiang Lab Open Fund (2020AA3AB04)
- China National Funds for Distinguished Young Scientists (61825204)
- Beijing Outstanding Young Scientist Program (BJJWZYJH01201910003011)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Internet Traffic Analysis and Secure E-voting
- Physical Sciences › Computer Science › Artificial Intelligence › Privacy-Preserving Technologies in Data
- Physical Sciences › Computer Science › Information Systems › Blockchain Technology Applications and Security
- Keywords
- decentralized applications, encrypted traffic classification, graph neural networks, blockchain, Ethereum, network traffic analysis
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Accurate Decentralized Application Identification via Encrypted Traffic Analysis Using Graph Neural Networks. https://app.cochat.ai/papers/10.1109/tifs.2021.3050608
- The paper
- Shen, M., Zhang, J., Zhu, L., Xu, K., & Du, X. (2021). Accurate Decentralized Application Identification via Encrypted Traffic Analysis Using Graph Neural Networks. IEEE Transactions on Information Forensics and Security. https://doi.org/10.1109/tifs.2021.3050608
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.