Frequency-Hiding Order-Preserving Encryption
Author:
Open Access
- 12 October 2015
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 656-667
Abstract
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 setsKeywords
This publication has 27 references indexed in Scilit:
- Semantically Secure Order-Revealing Encryption: Multi-input Functional Encryption Without Obfuscation2015
- Order-Preserving Encryption Revisited: Improved Security Analysis and Alternative Solutions2011
- Dictionary-based order-preserving string compression for main memory column stores2009
- Fully homomorphic encryption using ideal lattices2009
- Database Management as a Service: Challenges and Opportunities2009
- Order-Preserving Symmetric Encryption2009
- Conjunctive, Subset, and Range Queries on Encrypted Data2007
- Integrating compression and execution in column-oriented database systems2006
- Order preserving encryption for numeric data2004
- Construction of a tree from its traversals in optimal time and spaceInformation Processing Letters, 1990