Compact Probe Request Fingerprinting with Asymmetric Pairwise Boosting

December 13, 2024 Β· Declared Dead Β· πŸ› 2025 IEEE International Conference on Machine Learning for Communication and Networking (ICMLCN)

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Giovanni Baccichet, Fabio Palmese, Alessandro E. C. Redondi, Matteo Cesana arXiv ID 2412.10548 Category cs.NI: Networking & Internet Citations 0 Venue 2025 IEEE International Conference on Machine Learning for Communication and Networking (ICMLCN) Last Checked 4 months ago
Abstract
Probe Requests are Wi-Fi management frames periodically sent by devices during network discovery. Tracking Probe Requests over time offers insights into movement patterns, traffic flows, and behavior trends, which are keys in applications such as urban planning, human mobility analysis, and retail analytics. To protect user privacy, techniques such as MAC address randomization are employed, periodically altering device MAC addresses to limit tracking. However, research has shown that these privacy measures can be circumvented. By analyzing the Information Elements (IE) within the Probe Request body, it is possible to fingerprint devices and track users over time. This paper presents a machine learning-based approach for fingerprinting Wi-Fi Probe Requests in a compact fashion. We utilize Asymmetric Pairwise Boosting to learn discriminating filters which are then used to process specific bit sequences in Probe Request frames, and quantize the results into a compact binary format. Extensive evaluation on public datasets demonstrates a two-order-of-magnitude storage reduction compared to existing methods while maintaining robust fingerprinting performance.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” Networking & Internet

Died the same way β€” πŸ‘» Ghosted