Secure Join and Compute in Encrypted Database

In public and shared platforms where security is paramount, encrypted database storage and processing have become a key research priority. However, traditionally encrypted databases do not support direct computation of relational queries, and hence, those types of query processing are infeasible without intermediate decryption. To achieve end-to-end encrypted computation, such databases prefer fully homomorphic encryption (FHE), which demands circuit-based representation of any algorithm. In our work, along with other encrypted SQL operations, we analyze SQL join and show straightforward implementation, which incurs huge performance overhead. Not only in performance, number of ciphertext expansions is also huge in this case, which can trigger a sharp rise in performance overhead in encrypted domain. To address these challenges, we propose a lightweight solution only for joining the encrypted databases using pair-wise traditional column encryption with the introduction of primary and foreign keys. Then, we highlight how to perform homomorphic operations over that encrypted joining result. Our implementation shows 89.34% improvement compared to straightforward FHE-joining. Consequently, we demonstrate memory overhead reduction ∼13%.

Authors

Institutions

Publication Details

Published
2024-12-17
DOI
https://doi.org/10.1109/trustcom63139.2024.00204
Primary Topic
Chaos-based Image/Signal Encryption
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Secure Join and Compute in Encrypted Database

Ayantika Chatterjee, Tanusree Parbat
Chaos-based Image/Signal Encryption
article

Secure Join and Compute in Encrypted Database

Ayantika Chatterjee, Tanusree Parbat
article en

Abstract

In public and shared platforms where security is paramount, encrypted database storage and processing have become a key research priority. However, traditionally encrypted databases do not support direct computation of relational queries, and hence, those types of query processing are infeasible without intermediate decryption. To achieve end-to-end encrypted computation, such databases prefer fully homomorphic encryption (FHE), which demands circuit-based representation of any algorithm. In our work, along with other encrypted SQL operations, we analyze SQL join and show straightforward implementation, which incurs huge performance overhead. Not only in performance, number of ciphertext expansions is also huge in this case, which can trigger a sharp rise in performance overhead in encrypted domain. To address these challenges, we propose a lightweight solution only for joining the encrypted databases using pair-wise traditional column encryption with the introduction of primary and foreign keys. Then, we highlight how to perform homomorphic operations over that encrypted joining result. Our implementation shows 89.34% improvement compared to straightforward FHE-joining. Consequently, we demonstrate memory overhead reduction ∼13%.

Indian Institute of Technology Kharagpur (IN)
Openalex Percentile: Top 71%
Chaos-based Image/Signal Encryption
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.