Randomly Partitioned Encryption for Cloud Databases - LNCS 8566: Data and Applications Security and Privacy XXVIII Access content directly
Conference Papers Year : 2014

Randomly Partitioned Encryption for Cloud Databases


With the current advances in Cloud Computing, outsourcing data has never been so tempting. Along with outsourcing a database comes the privacy versus performance discussion. Order-Preserving Encryption (OPE) is one of the most attractive techniques for database encryption since it allows to execute range and rank queries efficiently without decrypting the data. On the other hand, people are reluctant to use OPE-based techniques in practice because of their vulnerability against adversaries with knowledge of the domain, its frequency distribution and query logs. This paper formally defines three real world driven attacks, called Domain Attack, Frequency Attack and Query Log Attack, typically launched by an honest-but-curious database or systems administrator. We also introduce measures to capture the probability distribution of the adversary’s advantage under each attacker model. Most importantly, we present a novel technique called Randomly Partitioned Encryption (RPE) to minimize the adversary’s advantage. Finally, we show that RPE not only withstands real world database adversaries, but also shows good performance that is close to state-of-art OPE schemes for both, read- and write-intensive workloads.
Fichier principal
Vignette du fichier
978-3-662-43936-4_20_Chapter.pdf (4 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01284865 , version 1 (08-03-2016)





Tahmineh Sanamrad, Lucas Braun, Donald Kossmann, Ramarathnam Venkatesan. Randomly Partitioned Encryption for Cloud Databases. 28th IFIP Annual Conference on Data and Applications Security and Privacy (DBSec), Jul 2014, Vienna, Austria. pp.307-323, ⟨10.1007/978-3-662-43936-4_20⟩. ⟨hal-01284865⟩
44 View
172 Download



Gmail Facebook X LinkedIn More