Database Paper Browser

Back to papers

HEDA: Multi-Attribute Unbounded Aggregation over Homomorphically Encrypted Database

Summary: HEDA shows feasibility of multi-attribute unbounded aggregation (comparisons + final aggregates) directly over FHE-encrypted databases by combining two complementary FHE schemes (numeric vs binary) to exploit their strengths. Novel ciphertext-transformation bridges schemes for interaction-free query processing; prototype runs TPC-H and real workloads (8k rows ≈430s), demonstrating proof-of-concept OLAP on FHE despite large overheads. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
13315
Venue
VLDB
Year
2023
Pagerank
9.4333516e-05
Overall Rank
2,146 | 85.08%
DOI
10.14778/3574245.3574248

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 9 of 9 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 12 of 12 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Previous Page 1 / 1 Next

Semantically Similar Papers