[Resource Topic] 2018/715: Practical Attacks on Relational Databases Protected via Searchable Encryption

Welcome to the resource topic for 2018/715

Title:
Practical Attacks on Relational Databases Protected via Searchable Encryption

Authors: Mohamed Ahmed Abdelraheem, Tobias Andersson, Christian Gehrmann, Cornelius Glackin

Abstract:

Searchable symmetric encryption (SSE) schemes are commonly proposed to enable search in a protected unstructured documents such as email archives or any set of sensitive text files. However, some SSE schemes have been recently proposed in order to protect relational databases. Most of the previous attacks on SSE schemes have only targeted its common use case, protecting unstructured data. In this work, we propose a new inference attack on relational databases protected via SSE schemes. Our inference attack enables a passive adversary with only basic knowledge about the meta-data information of the target relational database to recover the attribute names of some observed queries. This violates query privacy since the attribute name of a query is secret.

ePrint: https://eprint.iacr.org/2018/715

See all topics related to this paper.

Feel free to post resources that are related to this paper below.

Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.

For more information, see the rules for Resource Topics .