Explore our new Cybersecurity Terms Glossary, explained by our experts.

View the Glossary View the Glossary
PRIVIA

Cybersecurity Terms Glossary

What Are the Risks of Deterministic Encryption?

Deterministic encryption produces the same ciphertext for the same plaintext every time, which makes equality search possible and leaks far more than most teams expect.

Illustration for the cybersecurity term Deterministic Encryption
Home / Blog / Cybersecurity Terms / What Are the Risks of Deterministic Encryption?
17 November 2026

What Are the Risks of Deterministic Encryption?

What Are the Risks of Deterministic Encryption?

Encrypt the surname Smith twice with a randomised scheme and you get two unrelated ciphertexts. Encrypt it twice deterministically and you get the same value both times. That single property is what makes encrypted database columns searchable, joinable, and indexable — and it is also what gives an attacker a map of your data without ever recovering a key.

Teams usually arrive at deterministic encryption for a practical reason: the application needs WHERE email = ? to work, or two encrypted tables need to be joined, or a unique constraint has to hold. The trade-off is real, but it is often accepted without anyone writing down what it costs.

What Leaks

Deterministic ciphertext preserves the equality relation of the plaintext, and equality is enough to reconstruct a great deal.

The academic work is blunt about this. Naveed, Kamara, and Wright demonstrated in 2015 that inference attacks against property-preserving encrypted databases recovered a large proportion of attributes from real electronic health records, including mortality and sex, using nothing but public statistics and the ciphertext. Order-preserving encryption, which also leaks sort order, fared even worse.

Where It Still Appears

SettingWhy deterministicExposure
SQL Server Always Encrypted, deterministic modeSupports equality search, joins, groupingDocumented by Microsoft as leaking patterns in low-entropy columns
Application-side column encryptionNeeded for lookups and unique keysUsually the same key across all rows and environments
Tokenisation with a fixed mappingPreserves referential integrityEquivalent to deterministic encryption unless the vault randomises
Key wrapping and key derivationDeterminism is deliberate and safeInputs are high-entropy keys, not guessable values

That last row matters. Determinism is not wrong in itself; it is wrong when applied to low-entropy, guessable, or repeated plaintext. AES-SIV, specified in RFC 5297, is a deterministic authenticated mode designed precisely for wrapping keys, and it is the right tool there.

Safer Patterns

  1. Randomised encryption plus a blind index. Store the value with AES-GCM, and store a separate searchable column containing a truncated HMAC of the normalised plaintext under a dedicated index key. Equality search works; frequency analysis is blunted by truncation, which deliberately creates collisions; and the encryption itself leaks nothing.
  2. Narrow the deterministic surface. Apply determinism only to high-entropy identifiers such as account references, never to names, postcodes, diagnoses, or anything with a small value set.
  3. Separate keys per tenant or per dataset. This breaks cross-dataset linkage even where the scheme is deterministic.
  4. Push the search elsewhere. A searchable symmetric encryption scheme, an encrypted index in a separate trust domain, or a confidential computing enclave can give query functionality without exposing equality in the main store.
  5. Decide what the encryption is for. Column encryption defends against a stolen backup, a rogue database administrator, or a cloud provider — not against an application compromise, because the application holds the key either way.

The Regulatory Angle

Deterministically encrypted personal data is still personal data. The ICO treats pseudonymisation as a security measure, not as anonymisation, and data that can be re-linked to an individual — which deterministic ciphertext plainly can, by anyone holding a matching record — remains in scope for UK GDPR. Describing such a column as anonymised in a privacy notice or a data protection impact assessment is a misstatement worth catching before a regulator does.

Encryption may still reduce the risk rating of a breach under Article 34, but only if the exposed data could not reasonably be linked to individuals. A frequency-analysable column of diagnoses does not clear that bar.

Our infrastructure and architecture review services examine exactly these design decisions, because encrypted-at-rest is frequently recorded as a completed control when what was actually deployed leaks most of the information it was meant to hide.

FAQ – Frequently Asked Questions

Is Deterministic Encryption Always a Bad Idea?

No. It is the correct choice for key wrapping, where the plaintext is a random key with no guessable structure, and AES-SIV exists for that purpose. The problem arises when it is applied to low-entropy business data such as names, postcodes, statuses, or dates, where repetition and frequency carry most of the meaning.

How Does a Blind Index Work?

You normalise the plaintext, compute an HMAC with a key reserved for indexing, truncate the result to a few bytes, and store that alongside randomised ciphertext. Queries hash the search term the same way and filter on the index, then decrypt candidates and compare exactly. Truncation causes deliberate collisions, which blurs frequency while keeping lookups fast.

Does Randomised Encryption Break My Queries?

It breaks equality, joins, sorting, and unique constraints on the encrypted column, which is why teams reach for determinism in the first place. The usual answer is to keep the encryption randomised and add a separate blind index or a search service for the specific queries you need, rather than weakening the encryption for every row.

Is Encrypted Data Still Personal Data Under UK GDPR?

Yes, where you or anyone else can reverse the link to an individual. The ICO treats encryption and pseudonymisation as security measures rather than anonymisation. Deterministic ciphertext is especially clearly in scope, because matching a known value against the stored ciphertext re-identifies records without any key at all.

Related Terms

You May Be Interested In These

What Is Threat Modelling?

Cybersecurity Terms

17 November 2026

What Is Threat Modelling?

Read More
What Is Distributed Energy Resource Security?

Cybersecurity Terms

17 November 2026

What Is Distributed Energy Resource Security?

Read More
What Is Rubeus?

Cybersecurity Terms

17 November 2026

What Is Rubeus?

Read More