Order-Preserving Symmetric Encryption

By Alexandra Boldyreva, Nathan Chenette, Younho Lee, Adam O'Neill. IACR Cryptology ePrint Archive, 2009

941 citations recorded by the source corpus.

View Paper: https://www.semanticscholar.org/paper/f75c5ee8db682f37f0ebf16d62677823c02359af

How researchers see this paper

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

In Artificial Intelligence

Citations in the corpus

Secure Ranked Keyword Search over Encrypted Cloud Data (2010, methodology): “Finally, we demonstrate how to choose different scheme parameters via concrete examples.”
CryptDB: protecting confidentiality with encrypted query processing (2011, methodology): “Agrawal et al. develop a statistical encoding that preserves the order of numerical data in a column [1], but it does not have sound cryptographic properties, unlike the scheme we use [4].”
Inference Attacks on Property-Preserving Encrypted Databases (2015, positive): “In particular, it was shown in [12] that all (non-interactive) OPE schemes must leak more than the order.”
This Paper Is Included in the Proceedings of the 12th Usenix Symposium on Operating Systems Design and Implementation (osdi '16). Ryoan: a Distributed Sandbox for Untrusted Computation on Secret Data Ryoan: a Distributed Sandbox for Untrusted Computation on Secret Data (neutral): “Homomorphic encryption [25, 38] and order-preserving encryption [22] share similar motivations with Ryoan.”
Generic Attacks on Secure Outsourced Databases (2016, methodology): “…indexing (e.g. [27, 29, 28]), (ii) order-preserving encryption schemes that use deterministic encryption which ensures that the order of the cypher-texts is the same as the order of the plaintexts (e.g. [1, 7, 41]), and (iii) solutions that use specialized data structures (e.g. [35, 44, 17]).”
Multi-Input Functional Encryption (2014, methodology): “[8], resolving the primary open question in that line of research.”
Processing Analytical Queries over Encrypted Data (2013, methodology): “Overall, M ONOMI executes 19 out of 22 TPC-H queries at scale 10 with a median slowdown of just 1.24 × compared to a plaintext database, while Hacıgümü¸s et al handle just two out of 22 TPC-H queries at scale 0.1 and do not compare their performance to a plaintext database [15, 16].”
Privacy and accountability for location-based aggregate statistics (2011, background): “One possible solution is to use order-preserving encryption [4]: for two values a < b, encryption of a will be smaller than encryption of b.”
Order-Preserving Encryption Revisited: Improved Security Analysis and Alternative Solutions (2011, methodology): “Indeed, [8] showed that an ROPF with a practical range size does not hide distances between plaintexts.”
Enabling Secure and Efficient Ranked Keyword Search over Outsourced Cloud Data (2012, methodology): “The whole process is shown in Algorithm 1, adapted from [14].”