An Ideal-Security Protocol for Order-Preserving Encoding

Abstract

Order-preserving encryption-an encryption scheme where the sort order of ciphertexts matches the sort order of the corresponding plaintexts-allows databases and other applications to process queries involving order over encrypted data efficiently. The ideal security guarantee for order-preserving encryption put forth in the literature is for the ciphertexts to reveal no information about the plaintexts besides order. Even though more than a dozen schemes were proposed, all these schemes leak more information than order. This paper presents the first order-preserving scheme that achieves ideal security. Our main technique is mutable ciphertexts, meaning that over time, the ciphertexts for a small number of plaintext values change, and we prove that mutable ciphertexts are needed for ideal security. Our resulting protocol is interactive, with a small number of interactions. We implemented our scheme and evaluated it on microbenchmarks and in the context of an encrypted MySQL database application. We show that in addition to providing ideal security, our scheme achieves 1-2 orders of magnitude higher performance than the state-of-the-art order-preserving encryption scheme, which is less secure than our scheme.

Order-Preserving Encryption Secure Beyond One-Wayness

“…These notions are of independent interests and beyond our scope. mOPE and stOPE [38,39]: These notions, introduced by Popa, Li, and Zeldovich, are interactive protocols which allow a user to store plaintexts to a database in their encrypted forms and to compare the sizes of plaintexts in the database. These protocols can be run without revealing any information about plaintexts except their order.…”

A New Randomized Order Preserving Encryption Scheme

“…In [16] an OPE scheme called mutable order-preserving encoding (mOPE) was proposed that fulfills IND-OCPA with respect to encodings. The mOPE scheme functions by making a balanced search tree comprising all the encrypted data on a server, affording the server the power to order the tree based on the plaintexts without knowing any information about the plaintexts themselves.…”

“…This means that the scheme can leak information about the distribution of plaintext values. This paper introduces a novel scheme called Randomized Order Preserving Encryption (ROPE) which follows the mOPE scheme proposed in [16]. In ROPE scheme, DET is replaced with RND (random encryption) for the ciphertexts which prevents the leakage of information about the distribution of plaintext values.…”

Enhanced Secure Cloud Data Protection Model by Integrating Dual System Encryption Technology With Selective Proof Technique.

“…Recently, Bellare et al [17] defined a new primitive, Message-Locked Encryption (MLE), which brought rigor to security de duplication, and captured various security aspects of MLE. Also, they constructed several schemes and provided some detailed analysis over them [18].To strengthen the notions of security by considering plaintext distributions depending on the public parameter, two approaches (fully random scheme and deterministic scheme) that are secure even for lock-dependent message in realistic. It answered the question: Can message-locked encryption be secure for lock dependent message [19].…”

“…Recently, Bellare et al [17] defined a new primitive, Message-Locked Encryption (MLE), which brought rigor to security de duplication, and captured various security aspects of MLE. Also, they constructed several schemes and provided some detailed analysis over them [18].…”