mlsanityData to 14 Oct 2026

LLMs Have Rhythm: Fingerprinting Large Language Models Using Inter-Token Times and Network Traffic Analysis

arXiv 2502.20589 ↗First posted 27 Feb 2025cs.CR cs.AI cs.CLcited by 7

Not on the map. Why?

Abstract (arXiv)

As Large Language Models (LLMs) become increasingly integrated into many technological ecosystems across various domains and industries, identifying which model is deployed or being interacted with is critical for the security and trustworthiness of the systems. Current verification methods typically rely on analyzing the generated output to determine the source model. However, these techniques are susceptible to adversarial attacks, operate in a post-hoc manner, and may require access to the model weights to inject a verifiable fingerprint. In this paper, we propose a novel passive and non-invasive fingerprinting technique that operates in real-time and remains effective even under encrypted network traffic conditions. Our method leverages the intrinsic autoregressive generation nature of language models, which generate text one token at a time based on all previously generated tokens, creating a unique temporal pattern like a rhythm or heartbeat that persists even when the output is streamed over a network. We find that measuring the Inter-Token Times (ITTs)-time intervals between consecutive tokens-can identify different language models with high accuracy. We develop a Deep Learning (DL) pipeline to capture these timing patterns using network traffic analysis and evaluate it on 16 Small Language Models (SLMs) and 10 proprietary LLMs across different deployment scenarios, including local host machine (GPU/CPU), Local Area Network (LAN), Remote Network, and Virtual Private Network (VPN). The experimental results confirm that our proposed technique is effective and maintains high accuracy even when tested in different network conditions. This work opens a new avenue for model identification in real-world scenarios and contributes to more secure and trustworthy language model deployment.

Key facts. Cited by 7 papers in the map (data through 14 Oct 2026). Builds on 22 of its 37 references that are in the map. First posted on arXiv 27 Feb 2025.

Builds on

22 of 37 references.

References · 22

  1. 2017Attention Is All You Needcited by 60,361
  2. 2020Language Models are Few-Shot Learnerscited by 32,419
  3. 2023LLaMA: Open and Efficient Foundation Language Modelscited by 14,132
  4. 2013Efficient Estimation of Word Representations in Vector Spacecited by 4,375
  5. 2023Mistral 7Bcited by 3,164
  6. 2023A Survey of Large Language Modelscited by 2,576
  7. 2024Gemma 2: Improving Open Language Models at a Practical Sizecited by 1,998
  8. 2024Phi-3 Technical Report: A Highly Capable Language Model Locally on Your Phonecited by 1,917
  9. 2023A Watermark for Large Language Modelscited by 725
  10. 2023A Survey on Large Language Model (LLM) Security and Privacy: The Good, the Bad, and the Uglycited by 387
  11. 2023Can AI-Generated Text be Reliably Detected?cited by 386
  12. 2024Security and Privacy Challenges of Large Language Models: A Surveycited by 186
10 more
  1. 2024On Protecting the Data Privacy of Large Language Models (LLMs): A Surveycited by 96
  2. 2024Instructional Fingerprinting of Large Language Modelscited by 68
  3. 2023Privacy Issues in Large Language Models: A Surveycited by 60
  4. 2024SoK: Watermarking for AI-Generated Contentcited by 51
  5. 2024Hey, That's My Model! Introducing Chain & Hash, An LLM Fingerprinting Techniquecited by 37
  6. 2024Your Large Language Models Are Leaving Fingerprintscited by 33
  7. 2018Deep Learning for Encrypted Traffic Classification: An Overviewcited by 27
  8. 2024Hide and Seek: Fingerprinting Large Language Models with Evolutionary Learningcited by 18
  9. 2024On-Device LLMs for SMEs: Challenges and Opportunitiescited by 2
  10. 2020The Dark (and Bright) Side of IoT: Attacks and Countermeasures for Identifying Smart Home Devices and Servicescited by 1

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2025: 5; 2026: 2.

7 papers.