Order-revealing encryption (ORE) is an important cryptographic primitive in the study of searchable symmetric encryption because it allows for efficient range queries, sorting, and threshold filtering on encrypted data.
The original notion of order-revealing encryption, which was called "order-preserving encryption" (OPE), was proposed as a solution to allowing for efficient range queries on encrypted data. However, OPE schemes inherently leak a lot of additional information of their plaintexts, and are rather insecure.
ORE offers a solution to range queries on encrypted data without suffering from the same inherent limitations of OPE. Our goal is to construct and analyze ORE in a provably secure manner, and also to study the applicability of order-revealing encryption to real-world applications.The ideal ORE schemes are: