2012 IEEE Fifth International Conference on Cloud Computing 2012
DOI: 10.1109/cloud.2012.65
|View full text |Cite
|
Sign up to set email alerts
|

Programmable Order-Preserving Secure Index for Encrypted Database Query

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
47
0

Year Published

2013
2013
2023
2023

Publication Types

Select...
4
3
3

Relationship

1
9

Authors

Journals

citations
Cited by 63 publications
(47 citation statements)
references
References 10 publications
0
47
0
Order By: Relevance
“…Order preserving encryption (OPE) scheme is first presented by Agrawal et al (2004) in traditional database, which allows comparison operations to be directly applied on encrypted data, without decrypting the ciphertexts. After that, many OPEs are presented (Alexandra et al 2009;Lee et al 2009;Liu and Wang 2013;Kadhem et al 2010;Liu and Wang 2012;Yum et al 2012). Although there are so many OPEs presented by either academic researchers or industrial producers, the fatal problem of OPE has not been solved yet.…”
Section: Introductionmentioning
confidence: 93%
“…Order preserving encryption (OPE) scheme is first presented by Agrawal et al (2004) in traditional database, which allows comparison operations to be directly applied on encrypted data, without decrypting the ciphertexts. After that, many OPEs are presented (Alexandra et al 2009;Lee et al 2009;Liu and Wang 2013;Kadhem et al 2010;Liu and Wang 2012;Yum et al 2012). Although there are so many OPEs presented by either academic researchers or industrial producers, the fatal problem of OPE has not been solved yet.…”
Section: Introductionmentioning
confidence: 93%
“…Other schemes also provide the solution for leakage of information besides the order. These schemes do not provide a complete security guarantee [1], [2], [3], [4], [5], [6], [7], [8], [9], [10], [11], [12], [13], [17].…”
Section: Related Workmentioning
confidence: 99%
“…Table 1 presents an overview of the discussed order-preserving encryption schemes. There is also a large number of other order-preserving encryption schemes [4,19,20,24,25,26,28,38] which provide no formal, but rather ad-hoc security analysis, including the original proposal by Agrawal et al [5]. Xiao et al [37] define a notion based on nearby values, but it remains unclear how to enforce this in a practical setting.…”
Section: Order-preserving Encryption Schemesmentioning
confidence: 99%