2004
DOI: 10.1007/978-3-540-24571-1_10
|View full text |Cite
|
Sign up to set email alerts
|

Efficient Execution of Aggregation Queries over Encrypted Relational Databases

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
87
0
3

Year Published

2009
2009
2017
2017

Publication Types

Select...
5
4

Relationship

0
9

Authors

Journals

citations
Cited by 135 publications
(90 citation statements)
references
References 3 publications
0
87
0
3
Order By: Relevance
“…Moreover, this makes that much of a query operation over encrypted data can be processed at the database service provider, thereby, improving query performance. Later, in [14], the authors proposed to use the homomorphism encryption techniques to enhance their approach, so as to support aggregation queries over encrypted data, and in [15], the authors further discussed an optimization technique for their approach, i.e., how to use multiple communications between the server and the client to decrease the workload of the client. In order to better support range queries over encrypted data, Hore et al [7] explored an optimal approach to partitioning data domain, thereby, improving the precision of range queries.…”
Section: Related Workmentioning
confidence: 99%
See 1 more Smart Citation
“…Moreover, this makes that much of a query operation over encrypted data can be processed at the database service provider, thereby, improving query performance. Later, in [14], the authors proposed to use the homomorphism encryption techniques to enhance their approach, so as to support aggregation queries over encrypted data, and in [15], the authors further discussed an optimization technique for their approach, i.e., how to use multiple communications between the server and the client to decrease the workload of the client. In order to better support range queries over encrypted data, Hore et al [7] explored an optimal approach to partitioning data domain, thereby, improving the precision of range queries.…”
Section: Related Workmentioning
confidence: 99%
“…By analyzing the traditional order-preserving encryption approach to numerical data, a fuzzy matching encryption approach aiming at character strings was proposed in [19]. In this approach, a character string is first transformed to numerical values, and an order-preserving encryption technique in [14] for numerical data, is then used to encrypt the transformed numerical values. To solve the problem of not supporting range queries for the approach in [31], Wu et al [33] defined a structure called n-phase reachability matrix for a character string and used it as the characteristic index values, and then presented split a database query into its server-side representation and client-side representation for partitioning the computation of a query across the client and the server and thus improving query performance.…”
Section: Related Workmentioning
confidence: 99%
“…With the help of an homomorphic function, this approach is extended to support aggregation queries over ciphertexts [34]. The homomorphic encryption function is based on the Privacy Homomorphism (PH) scheme [57], which relies on the difficulty of factoring large composite integers, just like the famous RivestShamir-Adleman (RSA) public-key cryptosystem.…”
Section: Bucketization-based Indexingmentioning
confidence: 99%
“…As an example, order preserving encryption has been proposed as an effective solution for supporting range conditions, as well as grouping and ordering clauses (e.g., [1,46]). Aggregate functions can instead be computed if the index over the attribute of interest has been defined through homomorphic encryption techniques, which support the evaluation of arithmetic operators on encrypted data (e.g., [24,30]). Different techniques, which do not fit into the classification above, have also been proposed to the aim of enjoying the advantages of traditional database indexing techniques also in the outsourcing scenario (e.g., in [9] the authors propose to use encrypted B+-trees for the efficient evaluation of range queries).…”
Section: Efficient Access To Encrypted Datamentioning
confidence: 99%