University of British Columbia
Towards realistic assumptions in searchable symmetric encryption
Abstract
dc:descriptionSearchable Symmetric Encryption (SSE) enables keyword search over encrypted data, but practical schemes leak structured information during query execution. Leakage-abuse attacks exploit this information, yet their reported effectiveness depends heavily on assumptions about the attacker’s auxiliary knowledge, the client’s query behaviour, and the types of queries being issued. We examine how realistic current assumptions are and how they shape privacy conclusions. We find that LLM-generated documents are not a viable substitute for real auxiliary corpora to enhance leakage-abuse attacks because they fail to preserve the keyword distributions of domain-specific data. Real point-query traces exhibit temporal dependence and are better captured by a first-order Markov process, although temporal drift limits how well that dependence transfers across time which limits attack effectiveness in practical scenarios. Conjunctive queries expose a substantially stronger attack surface when dependence between keywords is modelled. Taken together, these results show that the apparent privacy of SSE is highly sensitive to the realism of the evaluation setup, and that credible privacy claims therefore require empirically grounded assumptions rather than idealized attack models.
Degree
thesis:*- Name thesis:degree_name
- Master of Applied Science - MASc
- Level thesis:degree_level
- master's
- Discipline thesis:degree_discipline
- Electrical and Computer Engineering
- Grantor dc:publisher
- University of British Columbia
- Year dc:date
- 2026
Author and committee
dc:creator, dc:contributor.*- Author dc:creator
-
- Chiu, Joshua
- Contributors dc:contributor
-
- Oya, Simon
- Gopalakrishnan, Sathish
Rights
dc:rights- Statement dc:rights
-
- Attribution-NonCommercial-NoDerivatives 4.0 International
- Language dc:language
- eng
Identifiers
dc:identifier.*- Handle dc:identifier
- http://hdl.handle.net/2429/94028