vix.ing · top · new · best · stats · spec

Large-scale online deanonymization with LLMs

LLMs enable scalable, high-precision deanonymization of pseudonymous online accounts using unstructured text.

2026/02/18 by Simon Lermen, Daniel Paleka, Joshua Swanson +3 · 85 voices · 1 citation
#cs.CR #cs.AI #cs.LG

paper · pdf

Abstract

We show that large language models can be used to perform at-scale deanonymization. With full Internet access, our agent can re-identify Hacker News users and Anthropic Interviewer participants at high precision, given pseudonymous online profiles and conversations alone, matching what would take hours for a dedicated human investigator. We then design attacks for the closed-world setting. Given two databases of pseudonymous individuals, each containing unstructured text written by or about that individual, we implement a scalable attack pipeline that uses LLMs to: (1) extract identity-relevant features, (2) search for candidate matches via semantic embeddings, and (3) reason over top candidates to verify matches and reduce false positives. Compared to classical deanonymization work (e.g., on the Netflix prize) that required structured data, our approach works directly on raw user content across arbitrary platforms. We construct three datasets with known ground-truth data to evaluate our attacks. The first links Hacker News to LinkedIn profiles, using cross-platform references that appear in the profiles. Our second dataset matches users across Reddit movie discussion communities; and the third splits a single user's Reddit history in time to create two pseudonymous profiles to be matched. In each setting, LLM-based methods substantially outperform classical baselines, achieving up to 68% recall at 90% precision compared to near 0% for the best non-LLM method. Our results show that the practical obscurity protecting pseudonymous users online no longer holds and that threat models for online privacy need to be reconsidered.

Summary

The researchers developed a pipeline that uses LLMs to extract identity features from raw text, search for candidates via embeddings, and reason over the results to verify matches. Testing across Hacker News, LinkedIn, and Reddit showed that LLM-based methods substantially outperform classical baselines in re-identifying users.

machine-generated · gemma4:31b

In simple words

People often use fake names online to stay hidden. This paper shows that smart computer programs can now find out who these people really are by looking at what they write. The programs look for small clues in many posts and match them to real people's profiles. This makes it much easier and cheaper to uncover identities than it was before.

machine-generated · gemma4:31b

Outline

machine-generated · gemma4:31b

Argument

  1. Pseudonymous accounts are protected by 'practical obscurity' because manual deanonymization is too costly.
    Assumption
  2. LLMs can extract identity-relevant features from unstructured text and reason over them to verify matches.
    Data (experimental results in the pipeline stages)
  3. A modular pipeline (Extract → Search → Reason → Calibrate) can automate this process at scale.
    Proof (empirical evaluation across three datasets)
  4. LLM-based methods significantly outperform classical baselines that rely on structured data or handcrafted features.
    Data (precision-recall curves and recall @ 99% precision metrics)
  5. The cost of deanonymization is now low enough that practical obscurity no longer protects users.
    Data (cost per profile estimated at 1-4; time reduced from hours to minutes)

machine-generated · gemma4:31b

Assumptions

machine-generated · gemma4:31b

Claims

machine-generated · gemma4:31b

Methods

machine-generated · gemma4:31b

Limitations

admitted by authors:

noticed by the model, not admitted:

machine-generated · gemma4:31b

Benchmarks

HN-LinkedIn matching

methodmetricvalue
Narayanan baselineRecall @ 99% Prec0.1%
Search (embedding)Recall @ 99% Prec4.4%
Reason (low)Recall @ 99% Prec36.0%
Reason (high)Recall @ 99% Prec45.1%

machine-generated · gemma4:31b

Open questions

machine-generated · gemma4:31b

Funding and conflicts

funded by:

no conflicts declared

machine-generated · gemma4:31b

Citations

Cited by

Discussions

Related