Nonlinear order preserving index for encrypted database query in service cloud environments

Liu, Dongxi; Wang, Shenlu

doi:10.1002/cpe.2992

Cited by 59 publications

(41 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

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%

Efficient request-based comparable encryption scheme based on sliding window method

Chen

2015

Soft Comput

View full text Add to dashboard Cite

In this paper, we present an efficient requestbased comparable encryption, which is based on sliding window techniques. Recently, Furukawa (Computer security-ESORICS 2013, Springer, 129-146, 2013) introduced a new primitive called request-based comparable encryption (comparable encryption for short) which overcomes the problem that OPEs cannot solve. OPEs have the problem that when all the numbers in a certain domain are encrypted by an OPE, an attacker can easily obtain all the orders of the encrypted numbers and hence retrieve the original numbers. However, comparable encryption is not efficient enough both in storage and in computation workload. Comparable encryption based on sliding window method Koç in Comput Math Appl 30:17-24, 1995 can adaptively adjust the window size to achieve a high performance. We set the window size as a constant number to conveniently generate ciphertexts and compare with others. Besides, the proposed scheme allows the users to obtain a variable trade-off between security and efficiency through adaptively setting the window size.

show abstract

Section: Introductionmentioning

confidence: 93%

Efficient request-based comparable encryption scheme based on sliding window method

Chen

2015

Soft Comput

View full text Add to dashboard Cite

show abstract

“…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%

Two layered protection for sensitive data in cloud

Hingwe

Bhanu

2014

2014 International Conference on Advances in Computing, Communications and Informatics (ICACCI)

View full text Add to dashboard Cite

Security and privacy are the biggest obstacles in Database as a service (DBaaS) of Cloud Computing. In DbaaS, cloud service providers provide services for storing customers data. As the data are managed by an un-trusted server, the service is not fully trustworthy. The data at the third party data center can be made secure by encrypting the database. But querying the encrypted database is not easy. The result can be obtained from the encrypted database either by decrypting the database for every query or the query itself is encrypted and encrypted query is executed over encrypted database. Another problem associated with most of the database encryption algorithms is that they do not support range query. The proposed framework performs database encryption, query encryption and also supports range query over encrypted databases. This framework is focused on securing database as well as storing sensitive information without any leaks. A double layered encryption is used for sensitive data and a single layer encryption is used for non-sensitive data. Order Preserving Encryption (OPE) is used for single layer encryption. OPE maintains the order in encrypted database and so range query can be performed over encrypted database using encrypted query. OPE has a drawback of revealing information and so for sensitive data, a double layered encryption using Format Preserving Encryption (FPE) followed by OPE symmetric key encryption algorithm is proposed. Symmetric key is used for both OPE and FPE but key is divided into two parts for double encryption.

show abstract

“…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%

Frequency-Hiding Order-Preserving Encryption

Kerschbaum

2015

Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security

128

120

View full text Add to dashboard Cite

Order-preserving encryption allows encrypting data, while still enabling efficient range queries on the encrypted data. This makes its performance and functionality very suitable for data outsourcing in cloud computing scenarios, but the security of order-preserving is still debatable. We present a scheme that achieves a strictly stronger notion of security than any other scheme so far. The basic idea is to randomize the ciphertexts to hide the frequency of plaintexts. Still, the client storage size remains small, in our experiments up to 1/15 of the plaintext size. As a result, one can more securely outsource large data sets, since we can also show that our security increases with larger data sets.

show abstract

Nonlinear order preserving index for encrypted database query in service cloud environments

Cited by 59 publications

References 17 publications

Efficient request-based comparable encryption scheme based on sliding window method

Efficient request-based comparable encryption scheme based on sliding window method

Two layered protection for sensitive data in cloud

Frequency-Hiding Order-Preserving Encryption

Contact Info

Product

Resources

About