<< All versions

Skill v1.0.0

currentAutomated scan100/100
mukul975/privacy-data-protection-skills/pseudonymization-risk
──Details
PublishedSeptember 29, 2026 at 09:03 PM
Content Hashsha256:2b5eda2a459f6d1b...
Git SHA9b2ef9eae161
──Files
Files (1 file, 12.7 KB)
SKILL.md12.7 KBactive
SKILL.md · 218 lines · 12.7 KB

version: "1.0.0" name: pseudonymization-risk description: >- Assessment of pseudonymization techniques and re-identification risk. Covers tokenization, hashing, encryption-based pseudonymization, and hybrid approaches. Includes re-identification risk scoring using the motivated intruder test, quantitative metrics (marketer, journalist, prosecutor models), and linkage attack resilience evaluation. References ENISA 2019 pseudonymization report. license: Apache-2.0 metadata: author: mukul975 version: "1.0" domain: privacy subdomain: privacy-by-design tags: "pseudonymization, re-identification, tokenization, hashing, enisa, motivated-intruder, linkage-attack"


Assessing Pseudonymization and Re-Identification Risk

Overview

Pseudonymization (GDPR Article 4(5)) means processing personal data in such a manner that the data can no longer be attributed to a specific data subject without the use of additional information, provided that such additional information is kept separately and is subject to technical and organisational measures to ensure non-attribution. Unlike anonymization (Recital 26), pseudonymized data remains personal data — but it significantly reduces risk and is explicitly recognized as an appropriate safeguard under Articles 25, 32, and 89.

The ENISA report "Pseudonymisation Techniques and Best Practices" (November 2019) provides a comprehensive taxonomy of pseudonymization techniques and their properties. This skill implements a structured assessment framework for selecting appropriate techniques and quantifying residual re-identification risk.

Pseudonymization Techniques Taxonomy

Technique 1: Counter-Based Pseudonyms

PropertyValue
MechanismSequential or random counter assigned to each identifier
ReversibilityReversible via lookup table
Collision resistanceGuaranteed (bijective mapping)
PerformanceO(1) lookup
Storage overheadMapping table size proportional to identifier count
Key managementProtect the mapping table as additional information

Prism Data Systems AG Implementation: Customer IDs are replaced with UUIDv4 pseudonyms at the analytics ingestion boundary. The mapping table is stored in a separate HSM-backed database accessible only to the DPO and the identity resolution service (which requires dual-approval access).

Technique 2: Cryptographic Hashing (HMAC)

PropertyValue
MechanismHMAC-SHA256 with secret key applied to identifier
ReversibilityNot directly reversible; vulnerable to brute-force on low-entropy inputs
Collision resistanceNegligible collision probability (256-bit output)
PerformanceO(1) computation
Storage overheadFixed 32-byte output per identifier
Key managementHMAC key must be protected as additional information

Risk: Plain SHA-256 hashing (without key) is vulnerable to rainbow table attacks on low-entropy identifiers like email addresses. HMAC with a secret key mitigates this but the key becomes the single point of re-identification.

Prism Data Systems AG Implementation: HMAC-SHA256 with a 256-bit key rotated quarterly is used for pseudonymizing user identifiers in the analytics pipeline. The HMAC key is stored in AWS KMS with access restricted to the pseudonymization service account. Key rotation triggers re-pseudonymization of the active analytics dataset.

Technique 3: Encryption-Based Pseudonymization

PropertyValue
MechanismAES-256-GCM or format-preserving encryption (FF1/FF3-1)
ReversibilityFully reversible with decryption key
Collision resistanceGuaranteed (bijective for same key)
PerformanceO(1) computation; FPE slower than standard AES
Storage overheadCiphertext size ≈ plaintext + 16-byte tag (GCM)
Key managementEncryption key is the additional information per Art. 4(5)

Format-Preserving Encryption preserves the format of the original identifier (e.g., encrypting a 10-digit phone number produces another 10-digit number), enabling pseudonymization without schema changes.

Prism Data Systems AG Implementation: FPE (FF3-1 mode) is used for pseudonymizing phone numbers and IBAN fields in the support ticket system. This allows Tier 1 support agents to see structurally valid but pseudonymized identifiers, reducing accidental exposure while maintaining workflow compatibility.

Technique 4: Tokenization

PropertyValue
MechanismRandom token generated and stored in a secure vault; no mathematical relationship to original
ReversibilityReversible only via vault lookup
Collision resistanceGuaranteed by vault uniqueness constraint
PerformanceO(1) vault lookup; network latency for centralized vault
Storage overheadVault stores original-to-token mapping
Key managementVault access controls replace key management

Prism Data Systems AG Implementation: Payment card data is tokenized using a PCI DSS-compliant token vault. The vault is operated by the payment processor and is logically separated from Prism's infrastructure. Detokenization requires a PCI-scoped service account with transaction-level authorization.

Technique 5: Synthetic Data Replacement

PropertyValue
MechanismReplace real identifiers with structurally similar but fictional values
ReversibilityNot reversible (one-way replacement)
Collision resistanceDepends on generation method; risk of accidental collision with real data
PerformanceO(1) generation
Storage overheadNo mapping table needed (irreversible)
Key managementNot applicable

Use case: Test environments where referential integrity must be maintained but no re-identification path is acceptable.

Technique Comparison Matrix

CriterionCounterHMACEncryptionTokenizationSynthetic
ReversibilityLookup tableBrute-force onlyDecryption keyVault lookupIrreversible
DeterministicConfigurableYes (same key)Yes (same key+IV)ConfigurableNo
Format preservingNoNoFPE onlyConfigurableYes
Linkability (same dataset)YesYesYesConfigurableNo
Linkability (cross-dataset)NoSame key: YesSame key: YesNoNo
Brute-force resistanceN/AKey-dependentKey-dependentN/AN/A
Suited for analyticsYesYesLimitedYesLimited
Suited for testingNoNoNoYesYes
ENISA recommendation levelBasicIntermediateAdvancedAdvancedSpecialized

Re-Identification Risk Assessment Framework

The Motivated Intruder Test

The UK Information Commissioner's Office (ICO) Anonymisation Code of Practice defines the motivated intruder test: would a reasonably competent, motivated person with access to resources such as the internet, public libraries, and public records be able to identify an individual from the pseudonymized data?

Assessment Factors:

FactorLow Risk (1)Medium Risk (3)High Risk (5)
Population uniquenessCommon attributes, large equivalence classesModerate uniqueness, some rare combinationsHighly unique attribute combinations
Auxiliary information availabilityNo public datasets linkableSome public records overlapRich public profiles (social media, registers)
Identifier entropyHigh entropy (e.g., UUID)Medium entropy (e.g., hashed email)Low entropy (e.g., hashed phone number)
Dataset richnessFew quasi-identifiersModerate quasi-identifiers (5-10)Many quasi-identifiers (>10)
Temporal precisionYearly or coarserMonthlyDaily or finer
Geographic precisionCountry levelRegion/city levelPostcode or finer
Domain sensitivityLow sensitivity domainModerate sensitivityHealth, financial, political data

Quantitative Risk Models

Prosecutor Model

The attacker knows a specific individual is in the dataset and attempts to find their record. Risk = 1 / k, where k is the size of the equivalence class containing the target record.

Journalist Model

The attacker does not know if the target is in the dataset but attempts to re-identify any individual for a story. Risk = max(1/k) across all equivalence classes (the smallest group is most vulnerable).

Marketer Model

The attacker attempts to re-identify as many individuals as possible. Risk = (1/n) * Σ(1/k_i) — the average re-identification probability across all records.

Linkage Attack Categories

Attack TypeDescriptionMitigation
Record linkageMatching pseudonymized records with identified records in external datasets using quasi-identifiersGeneralize quasi-identifiers, enforce k-anonymity
Attribute linkageInferring sensitive attributes from group characteristics even without identifying the individualEnforce l-diversity on sensitive attributes
Table linkageDetermining that an individual is present in a sensitive dataset (membership inference)Apply differential privacy, enforce t-closeness
Composition attackCombining multiple independent pseudonymized releases to narrow equivalence classesTrack cumulative privacy budget, limit releases
Temporal linkageLinking records across time periods using behavioral patterns or trajectory dataApply temporal generalization, add noise to timestamps

Risk Scoring Methodology

Step 1: Technique Assessment (0-100)

Score the pseudonymization technique on five properties:

PropertyWeightScore Range
Key/mapping security30%0-100 based on key management maturity
Brute-force resistance25%0-100 based on input entropy and computational cost
Cross-dataset unlinkability20%0-100 based on determinism and key reuse
Implementation maturity15%0-100 based on library validation and audit history
Operational resilience10%0-100 based on key rotation, backup, disaster recovery

Step 2: Data Environment Assessment (0-100)

Score the data environment on re-identification risk factors:

FactorWeightScore Range
Population uniqueness25%0-100 (higher = more unique = higher risk)
Auxiliary data availability25%0-100 (higher = more auxiliary data = higher risk)
Quasi-identifier count20%0-100 based on number and granularity
Dataset size15%0-100 (smaller datasets = higher risk per record)
Release frequency15%0-100 (more frequent releases = higher composition risk)

Step 3: Residual Risk Score

Residual Risk = Data Environment Risk × (1 - Technique Score / 100)
Residual Risk RangeClassificationAction Required
0-15LowAcceptable. Document and monitor
16-35ModerateAdditional controls recommended
36-60HighTechnique upgrade or data reduction required
61-100Very HighProcessing should not proceed without anonymization

Prism Data Systems AG — Assessment Summary

Data FlowTechniqueTechnique ScoreEnvironment RiskResidual RiskClassification
Analytics pipelineHMAC-SHA256 (keyed)78429.2Low
Support dashboardFPE (FF3-1)82356.3Low
Payment processingTokenization (vault)91555.0Low
Test environmentsSynthetic replacement95201.0Low
Research exportsCounter + k-anonymity725816.2Moderate
ML training dataHMAC + differential privacy85487.2Low

The research exports flow received a "Moderate" classification due to the combination of rich quasi-identifiers in the exported dataset and the counter-based technique's susceptibility to record linkage. Remediation: apply l-diversity (l≥3) on sensitive attributes and generalize quasi-identifiers to achieve k≥11 before export.

Key Regulatory References

  • GDPR Article 4(5) — Definition of pseudonymization
  • GDPR Recital 26 — Anonymization vs. pseudonymization distinction
  • GDPR Article 25(1) — Pseudonymization as a data protection by design measure
  • GDPR Article 32(1)(a) — Pseudonymization as a security measure
  • GDPR Article 89(1) — Pseudonymization for research processing safeguards
  • ENISA "Pseudonymisation Techniques and Best Practices" (November 2019)
  • ICO Anonymisation Code of Practice — Motivated intruder test
  • Article 29 Working Party Opinion 05/2014 (WP216) on Anonymisation Techniques
  • EDPB Guidelines 4/2019 on Article 25 — Pseudonymization as by-design measure
All versions