Encrypted databases systems and searchable encryption schemes still leak critical information (e.g.: access patterns) and require a choice between privacy and efficiency.
We show that using ORAM schemes as a black-box is not a panacea and that optimizations are still possible by improving the data structures.
We design an ORAM-based secure database that is built from the ground up: we replicate the typical data structure of a database system using different optimized ORAM constructions and derive a new solution for oblivious searches on databases.
Our construction has a lower bandwidth overhead than state-of-the-art ORAM constructions by moving client-side computations to a proxy with an intermediate (rigorously defined) level of trust, instantiated as a server-side isolated execution environment.
We formally prove the security of our construction and show that its access patterns depend only on public information. We also provide an implementation compatible with SQL databases (PostgresSQL).
Our system is 1.2 times to 4 times faster than state-of-the-art ORAM-based solutions.

Go to Source of this post
Author Of this post:

By admin