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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
