University of Twente Student Theses


Active Reconstruction Attacks on 2D Range Databases

Sierink, T.G. (2022) Active Reconstruction Attacks on 2D Range Databases.

[img] PDF
Abstract:The rise of searchable encryption solutions brings with it a rise of new security needs. In the context of searchable encryption, specifically 2D range query databases, passive reconstruction attacks have been proven to be effective in various situations. This paper set out to discover what extra possibilities an active attacker has, and how these might applied to improve chances of fully reconstructing a database. In this study, experiments have been performed on a 30x30 database. These are under the assumption that the scheme has not mitigated leakage and that there is no forward secrecy. Of these methods found, replaying queries and injection show to be capable of query reconstruction. Should the active attacker have access to the encrypted values, there is no additional advantage for them to make use of. Targeted record injection in and close to the databases' corners show an increased chance of full reconstruction, especially after post processing. The average Mean Squared Error per reconstruction is lower for injected databases, improving the expected accuracy should the adversary have to pick a random database from the returned reconstruction set. For a specific injection method, this set is reduced in size by around 10%. Overall, an active attacker has a clear, additional advantage over a passive attacker for all injection methods for a point density of around 50-55 points. This effect is consistent for other square domain sizes besides 30x30, with different relative densities.
Item Type:Essay (Master)
Faculty:EEMCS: Electrical Engineering, Mathematics and Computer Science
Subject:54 computer science
Programme:Computer Science MSc (60300)
Link to this item:
Export this item as:BibTeX
HTML Citation
Reference Manager


Repository Staff Only: item control page