Balancing confidentiality and efficiency in untrusted relational DBMSs

409 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

CryptDB: protecting confidentiality with encrypted query processing (2011, background): “Some researchers have developed prototype systems for subsets of SQL, but they provide no confidentiality guarantees, require a significant DBMS rewrite, and rely on client-side processing [9, 12, 22].”
Order preserving encryption for numeric data (2004, background): “It has been pointed out in [6] that the indexes proposed in [13] can open the door to interference and linking attacks.”
A Privacy-Preserving Index for Range Queries (2004, background): “Recently authors in [3] have explored the issue of exposure and quantified it in a different setting where hashing has been used instead of bucketization.”
Multi-Dimensional Range Query over Encrypted Data (2007, background): “Applications of searchable encryption have been studied by the database community [30, 22, 2].”
Deterministic and Efficiently Searchable Encryption (2007, background): “Sub-linear time searchable encryption has been much targeted by the database security community [45, 3, 36, 25, 38, 39, 41, 37, 19, 51].”
TrustedDB: A Trusted Hardware-Based Database with Privacy and Data Confidentiality (2011, methodology): “Above solutions are specialized for certain types of query operations on encrypted data: [12] for equality predicates, [20], [45], [46] for range predicates, and [19], [42] for aggregation.”