Optimal Re-encryption Strategy for Joins in Encrypted Databases - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2013

Optimal Re-encryption Strategy for Joins in Encrypted Databases

Florian Kerschbaum
  • Function : Author
  • PersonId : 984177
Martin Härterich
  • Function : Author
  • PersonId : 1004136
Patrick Grofig
  • Function : Author
  • PersonId : 1004137
Mathias Kohler
  • Function : Author
  • PersonId : 1004138
Andreas Schaad
  • Function : Author
  • PersonId : 1004139
Axel Schröpfer
  • Function : Author
  • PersonId : 1004140
Walter Tighzert
  • Function : Author
  • PersonId : 1004141


In order to perform a join in a deterministically, adjustably encrypted database one has to re-encrypt at least one column. The problem is to select that column that will result in the minimum number of re-encryptions even under an unknown schedule of joins. Naive strategies may perform too many or even infinitely many re-encryptions. We provide two strategies that allow for a much better performance. In particular the asymptotic behavior is O(n3/2) resp. O(n logn) re-encryptions for n columns. We show that there can be no algorithm better than O(n logn). We further extend our result to element-wise re-encryptions and show experimentally that our algorithm results in the optimal cost in 41% of the cases.
Fichier principal
Vignette du fichier
978-3-642-39256-6_13_Chapter.pdf (154.85 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01490705 , version 1 (15-03-2017)





Florian Kerschbaum, Martin Härterich, Patrick Grofig, Mathias Kohler, Andreas Schaad, et al.. Optimal Re-encryption Strategy for Joins in Encrypted Databases. 27th Data and Applications Security and Privacy (DBSec), Jul 2013, Newark, NJ, United States. pp.195-210, ⟨10.1007/978-3-642-39256-6_13⟩. ⟨hal-01490705⟩
326 View
106 Download



Gmail Facebook X LinkedIn More