The Community for Technology Leaders
2017 IEEE Second International Conference on Data Science in Cyberspace (DSC) (2017)
Shenzhen, Guangdong, China
June 26, 2017 to June 29, 2017
ISBN: 978-1-5386-1600-0
pp: 578-584
ABSTRACT
Order-revealing encryption (ORE) is a kind of encryption designed to support searches on ciphertexts. ORE enables efficient range query on ciphertexts, and it has been used in systems aimed at practical use. However, ORE has weaker security than conventional cryptography. To assess the security of ORE, researchers proposed concepts such as indistinguishability and one-wayness. Our work discusses the security of ORE when multiple columns are encrypted with ORE. This paper addresses two issues. First, we show an attacker can use quantile attack to distinguish two plaintext distributions with background information. Simulations show the attack succeed with high probability. Second, we propose a scheme to resist the quantile attack by adding dummy data. The proposed scheme calculates the number and position of dummy data based on the plaintext distribution and expected security level. We conduct experiments on a real dataset to show the performance of proposed scheme.
INDEX TERMS
Encryption, Gaussian distribution, Correlation, Resists, Frequency measurement
CITATION

C. Yang, W. Zhang and N. Yu, "Range Queries on Two Column Data," 2017 IEEE Second International Conference on Data Science in Cyberspace (DSC), Shenzhen, Guangdong, China, 2017, pp. 578-584.
doi:10.1109/DSC.2017.49
95 ms
(Ver 3.3 (11022016))