Sciweavers

Share
CCS
2015
ACM

Frequency-Hiding Order-Preserving Encryption

3 years 7 months ago
Frequency-Hiding Order-Preserving Encryption
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. Categories and Subject Descriptors D.4.6 [Operating Systems]: Security and Protection— Cryptographic controls; H.2.0 [Database Management]: General—Security, integrity, and protection Keywords Order-Preserving Encryption; Randomization; Indistinguishability
Florian Kerschbaum
Added 17 Apr 2016
Updated 17 Apr 2016
Type Journal
Year 2015
Where CCS
Authors Florian Kerschbaum
Comments (0)
books