THS: an efficient and secure SUM queries scheme for encrypted databases

Abstract

Translate Article

SUM queries are one of the most important query services in outsourced encrypted databases. Many current traditional solutions rely on homomorphic encryption (HE) algorithms to perform additional calculations on encrypted data. However, the query efficiency is extremely low and the performance is poor. To address these issues, this paper proposes THS, an efficient secure database SUM query solution. The solution first establishes a B+ tree index structure and adds a field to each non-leaf node of the B+ tree to store the sum of all child nodes for that node. The solution also incorporates an efficient HE algorithm, enabling direct summation calculations and reducing computation pressure. Our solution achieves a time complexity of O(1) for SUM queries and can be flexibly integrated into any encrypted database. In scenarios with frequent SUM queries, comparative analysis with other solutions currently demonstrates that THS is significantly superior in various dimensions.