%0 Conference Proceedings
%T Randomly Partitioned Encryption for Cloud Databases
%+ Eidgenössische Technische Hochschule - Swiss Federal Institute of Technology  [Zürich] (ETH Zürich)
%+ Microsoft Research
%A Sanamrad, Tahmineh
%A Braun, Lucas
%A Kossmann, Donald
%A Venkatesan, Ramarathnam
%< avec comité de lecture
%( Lecture Notes in Computer Science
%B 28th IFIP Annual Conference on Data and Applications Security and Privacy (DBSec)
%C Vienna, Austria
%Y David Hutchison
%Y Takeo Kanade
%Y Bernhard Steffen
%Y Demetri Terzopoulos
%Y Doug Tygar
%Y Gerhard Weikum
%Y Vijay Atluri
%Y Günther Pernul
%Y Josef Kittler
%Y Jon M. Kleinberg
%Y Alfred Kobsa
%Y Friedemann Mattern
%Y John C. Mitchell
%Y Moni Naor
%Y Oscar Nierstrasz
%Y C. Pandu Rangan
%I Springer
%3 Data and Applications Security and Privacy XXVIII
%V LNCS-8566
%P 307-323
%8 2014-07-14
%D 2014
%R 10.1007/978-3-662-43936-4_20
%K Database Encryption
%K Efficient Query Processing
%K Domain Attack
%K Frequency Attack
%K Query Log Attack
%K Randomly Partitioned Encryption
%Z Computer Science [cs]Conference papers
%X 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.
%G English
%Z TC 11
%Z WG 11.3
%2 https://inria.hal.science/hal-01284865/document
%2 https://inria.hal.science/hal-01284865/file/978-3-662-43936-4_20_Chapter.pdf
%L hal-01284865
%U https://inria.hal.science/hal-01284865
%~ IFIP-LNCS
%~ IFIP
%~ IFIP-TC
%~ IFIP-WG
%~ IFIP-TC11
%~ IFIP-LNCS-8566
%~ IFIP-WG11-3