Order-Preserving Encryption Revisited: Improved Security Analysis and Alternative Solutions

By Alexandra Boldyreva, Nathan Chenette, Adam O'Neill. Annual International Cryptology Conference, 2011

545 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

An Ideal-Security Protocol for Order-Preserving Encoding (2013, methodology): “( ) Unlike prior schemes, our scheme uses an interactive protocol and mutable ciphertexts. context of mail servers [3, 9, 32], web applications [9, 32], CRM software [9, 35], and others.”
Cloud security issues and challenges: A survey (2017, unknown): “[150] [167] Order-preserving encryption [27]”
Inference Attacks on Property-Preserving Encrypted Databases (2015, unknown): “OPE was introduced by Agrawal, Kiernan, Srikant and Xu [7] and studied formally by Boldyreva, Chenette, Lee and O’Neill in [12] and Boldyreva, Chenette and O’Neill [13].”
Generic Attacks on Secure Outsourced Databases (2016, background): “We note that in the case of order-preserving encryption, security on very large domains was studied by [8], who showed that OPE hides half of the bits of each plaintext for a dataset of uniformly chosen points (where the adversary gets the OPE encryptions of these points).”
Multi-Input Functional Encryption (2014, methodology): “Multi-input symmetric-key FE can be used for searching over encrypted data, where it can function in the same role as order-preserving encryption (OPE) [8, 9] or, more generally, property-preserving encryption [28].”