2004
DOI: 10.1007/978-3-540-30497-5_158
|View full text |Cite
|
Sign up to set email alerts
|

Fast Query Over Encrypted Character Data in Database

Abstract: There are a lot of very important data in database, which need to be protected from attacking. Cryptographic support is an important mechanism of securing them. People, however, must tradeoff performance to ensure the security because the operation of encryption and decryption greatly degrades query performance. To solve such a problem, an approach is proposed that can implement SQL query on the encrypted character data. When the character data are stored in the form of cipher, we not only store the encrypted … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
21
0
1

Year Published

2011
2011
2022
2022

Publication Types

Select...
4
1

Relationship

0
5

Authors

Journals

citations
Cited by 25 publications
(22 citation statements)
references
References 3 publications
0
21
0
1
Order By: Relevance
“…Actually, aiming at the problem of querying encrypted textual data in a database, there are some related studies. Wang et al [31] proposed to turn a character string into characteristic values, so as to support similarity queries. This approach can reduce the scope of data decryption, and thus improve query performance.…”
Section: Related Workmentioning
confidence: 99%
See 4 more Smart Citations
“…Actually, aiming at the problem of querying encrypted textual data in a database, there are some related studies. Wang et al [31] proposed to turn a character string into characteristic values, so as to support similarity queries. This approach can reduce the scope of data decryption, and thus improve query performance.…”
Section: Related Workmentioning
confidence: 99%
“…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. However, it is space-consuming to store a complete reachability matrix.…”
Section: Related Workmentioning
confidence: 99%
See 3 more Smart Citations