StateFi: Effectively Identifying Wi-Fi Devices through State Transitions
Abhishek K. Mishra, and Mathieu Cunche

TL;DR
StateFi introduces a finite-state machine-based fingerprinting method that effectively identifies Wi-Fi devices by modeling behavioral patterns, outperforming prior syntactic approaches even under MAC randomization in diverse environments.
Contribution
The paper presents a novel FSM-based fingerprinting framework that captures device behavior for robust identification, surpassing existing syntactic feature methods especially under MAC randomization.
Findings
Achieves 94-97% accuracy in in-network fingerprinting.
Re-identifies devices under MAC randomization with up to 97% accuracy.
Outperforms prior methods by up to 17 percentage points in discrimination accuracy.
Abstract
Randomized MAC addresses aim to prevent passive device tracking, yet Wi-Fi management frames still leak structured behavioral patterns. Prior work has relied primarily on syntactic probe-request features such as Information Elements (IEs), sequence numbers (SEQ), or RSSI correlations, which degrade in dense environments and fail under aggressive randomization. We introduce StateFi, a fingerprinting framework that models device behavior as finite-state machines (FSMs), capturing both structural transition patterns and temporal execution logic. These FSMs are embedded into compact feature vectors that support efficient similarity computation and supervised classification. Across five heterogeneous campus environments, StateFi achieves 94-97% accuracy for in-network fingerprinting using full management-frame FSMs. With probe-only FSMs, it re-identifies devices under MAC randomization with…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
