← Latest papers
🤖 AI

Addressing Labelled Data Scarcity: Taxonomy-Agnostic Annotation of PII Values in HTTP Traffic using LLMs

This paper proposes and evaluates a multi-stage Large Language Model pipeline that enables flexible, taxonomy-agnostic annotation of Personally Identifiable Information in HTTP traffic, addressing data scarcity through synthetic traffic generation and demonstrating accurate detection across diverse privacy definitions.

Original authors: Thomas Cory, Axel Küpper

Published 2026-05-08
📖 5 min read🧠 Deep dive

Original authors: Thomas Cory, Axel Küpper

Original paper licensed under CC BY 4.0 (http://creativecommons.org/licenses/by/4.0/). This is an AI-generated explanation of the paper below. It is not written or endorsed by the authors. For technical accuracy, refer to the original paper. Read full disclaimer

Imagine you are a privacy inspector for a busy city. Your job is to check every letter, package, and digital message leaving the city to make sure no one is accidentally sending out secret personal information (like home addresses, phone numbers, or medical records). This secret information is called PII (Personally Identifiable Information).

For years, inspectors have used two main tools:

  1. The Rulebook: A rigid list of keywords (like "email" or "SSN"). This works well for simple letters but fails when people write things in weird ways or use code.
  2. The Trained Dog: A machine learning model trained on thousands of examples. It's smart, but it only knows the specific rules it was taught. If the rules change (e.g., a new law defines "health data" differently), the dog needs to be retrained from scratch, which takes a long time and requires a massive supply of real, secret letters to study.

The Problem: Real secret letters are hard to get (because of privacy laws), and the rules for what counts as "secret" are always changing. This leaves inspectors with a shortage of good training data and tools that can't adapt.

The New Solution: The "Super-Translator"

This paper introduces a new approach using Large Language Models (LLMs). Think of an LLM not as a trained dog, but as a super-smart, flexible translator who has read almost everything in the library. You don't need to train this translator on specific rules; you just hand them the rulebook right now (at runtime), and they can instantly understand it.

Here is how the authors built their system, using simple analogies:

1. The Assembly Line (The Pipeline)

Instead of asking the translator to do everything at once, the authors built a three-step assembly line:

  • Step 1: The Cleaner (Pre-processing): Before the translator sees the message, a machine cleans it up. It unscrambles codes (like turning %20 back into a space) so the translator sees a clear, readable sentence.
  • Step 2: The Detective & The Scribe (Two-Stage Annotation):
    • The Detective: First, the LLM looks at the message and says, "I see a phone number and a name here, but no medical records." It creates a short list of what to look for.
    • The Scribe: Then, a second pass focuses only on finding the exact text for those specific items. By narrowing the focus, the Scribe doesn't get confused by other numbers or words.
  • Step 3: The Editor (Review): A final check looks at the work. If the Scribe missed a number or grabbed the wrong word, the Editor fixes it.

2. The "Fake Letter" Factory (Synthetic Data)

Since the inspectors can't use real people's secret letters to train their tools, the authors built a Factory that makes fake letters.

  • This factory takes a rulebook (a taxonomy) and asks the LLM to write realistic-looking letters that contain specific secrets (like "John Doe's phone number").
  • Crucially, the factory also writes down the answers (the ground truth) for every letter it makes.
  • Why this matters: This solves the "shortage" problem. You can generate thousands of practice letters with perfect answers instantly, without ever touching a real person's private data.

3. The Test Drive (Evaluation)

The authors tested this system with three different "Rulebooks" (Taxonomies):

  1. AI4Privacy: A broad list of common secrets (names, emails, IDs).
  2. mHealth: A specific list for health apps (vital signs, fitness data).
  3. PlayStore: A high-level list used by app stores (e.g., "Financial Data" or "Location").

The Results:

  • Success: The system worked incredibly well on the first two rulebooks. It could read a message, look at the specific rulebook provided that day, and accurately find the secrets.
  • Challenge: It struggled a bit more with the "PlayStore" rulebook. The authors explain this is because that rulebook uses very broad categories (like "Financial Data") that are harder to pin down to a specific word in a message than concrete things like "Phone Number."
  • The "Editor" Step: Interestingly, the final "Editor" step didn't always make things better. Sometimes it fixed mistakes, but other times it introduced new ones. The authors suggest this might be because the Editor was using the same "brain" as the Scribe, so it made the same kinds of mistakes.

The Bottom Line

This paper proves that you don't need to retrain a machine every time privacy rules change. Instead, you can use a flexible AI that reads the rules on the fly.

  • For Inspectors: You can swap rulebooks instantly without rebuilding your tools.
  • For Data Scarcity: You can generate your own practice data (fake letters) to test your tools, so you don't need to steal real people's data.

The authors conclude that while this isn't a perfect replacement for lightweight, fast detectors yet, it is a powerful tool for creating high-quality training data and auditing systems as privacy laws evolve. They suggest the best future path is to use this flexible AI to create the data, and then teach smaller, faster machines how to do the job.

Drowning in papers in your field?

Get daily digests of the most novel papers matching your research keywords — with technical summaries, in your language.

Try Digest →