%0 Conference Proceedings
%T On Minimizing the Size of Encrypted Databases
%+ Applied Communication Sciences [Basking Ridge, NJ] (ACS)
%A Crescenzo, Giovanni, Di
%A Shallcross, David
%< 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 364-372
%8 2014-07-14
%D 2014
%R 10.1007/978-3-662-43936-4_24
%Z Computer Science [cs]Conference papers
%X Motivated by applications to maintaining confidentiality and efficiency of encrypted data access in cloud computing, we uncovered an inherent confidentiality weakness in databases outsourced to cloud servers, even when encrypted. To address this weakness, we formulated a new privacy notion for outsourced databases and (variants of) a classical record length optimization problem, whose solutions achieve the new privacy notion. Our algorithmic investigation resulted in a number of exact and approximate algorithms,for arbitrary input distributions, and in the presence of record additions and deletions. Previous work only analyzed an unconstrained variant of our optimization problem for specific input distributions, with no attention to running time or database updates.
%G English
%Z TC 11
%Z WG 11.3
%2 https://inria.hal.science/hal-01284872/document
%2 https://inria.hal.science/hal-01284872/file/978-3-662-43936-4_24_Chapter.pdf
%L hal-01284872
%U https://inria.hal.science/hal-01284872
%~ IFIP-LNCS
%~ IFIP
%~ IFIP-TC
%~ IFIP-WG
%~ IFIP-TC11
%~ IFIP-LNCS-8566
%~ IFIP-WG11-3