Order-Revealing Encryption and the Hardness of Private Learning

Bun, Mark; Zhandry, Mark

doi:10.1007/978-3-662-49096-9_8

Cited by 23 publications

(10 citation statements)

References 55 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…However, the performance of Lewi-Wu [22] decreased exponentially as the block size increased and Lewi-Wu [22] would take a lot of time due to the use of hash primitives. Subsequent works [19,24,39,40] had conducted many studies on other information leakages that compromise the confidentiality and privacy of the entire data. In 2017, Haagh et al [40] generalized the cryptographic notion of ORE to arbitrary functions and did not rely on cryptographic obfuscation or multilinear map.…”

Section: Related Workmentioning

confidence: 99%

EncodeORE: Reducing Leakage and Preserving Practicality in Order-Revealing Encryption

Liu

et al. 2022

IEEE Trans. Dependable and Secure Comput.

View full text Add to dashboard Cite

Order-preserving encryption (OPE) is a cryptographic primitive that preserves the order of plaintexts. In the past few years, many OPE schemes were proposed to solve the problem of executing range queries in encrypted databases. However, OPE leaks some certain information (for example, the order of ciphertext), so it is vulnerable to many attacks. Subsequently, order-revealing encryption (ORE) was proposed by Boneh et al. (Eurocrypt 2015) as a generalization of order-preserving encryption. It breaks through the limitation of the numeric order of OPE plaintext. It implements ciphertext comparison for any specific form of plaintext through a publicly computable comparison function. In this work, we aim to design a new ORE scheme which reduces the leakages and preserves the practicality in terms of ciphertext length and encryption time. We first propose the hybrid model named HybridORE. Then, we propose an improved scheme named EncodeORE which achieves acceptable security and appropriate ciphertext length. They both explore the encode strategy of encoding plaintext into different parts and apply suitable ORE algorithms to each part according to its security characteristics to reduce leakages. Compared with the typical CLWW scheme (FSE 2016) and Lewi-Wu (CCS 2016) in large domain, they have fewer leakages. The experiment shows that the proposed EncodeORE is very practical.

show abstract

Section: Related Workmentioning

confidence: 99%

EncodeORE: Reducing Leakage and Preserving Practicality in Order-Revealing Encryption

Liu

et al. 2022

IEEE Trans. Dependable and Secure Comput.

View full text Add to dashboard Cite

show abstract

“…Recently, Bun and Zhandry [13] investigated the connection between orderrevealing encryption and problems in learning theory.…”

Section: Orementioning

confidence: 99%

Practical Order-Revealing Encryption with Limited Leakage

Chenette

Lewi

Weis

et al. 2016

Fast Software Encryption

130

185

View full text Add to dashboard Cite

In an order-preserving encryption scheme, the encryption algorithm produces ciphertexts that preserve the order of their plaintexts. Order-preserving encryption schemes have been studied intensely in the last decade, and yet not much is known about the security of these schemes. Very recently, Boneh et al. (Eurocrypt 2015) introduced a generalization of order-preserving encryption, called order-revealing encryption, and presented a construction which achieves this notion with best-possible security. Because their construction relies on multilinear maps, it is too impractical for most applications and therefore remains a theoretical result.In this work, we build efficiently implementable order-revealing encryption from pseudorandom functions. We present the first efficient order-revealing encryption scheme which achieves a simulation-based security notion with respect to a leakage function that precisely quantifies what is leaked by the scheme. In fact, ciphertexts in our scheme are only about 1.6 times longer than their plaintexts. Moreover, we show how composing our construction with existing order-preserving encryption schemes results in order-revealing encryption that is strictly more secure than all preceding order-preserving encryption schemes.

show abstract

“…In addition, there are a number of ORE schemes [10,18,46,16,15,11,28,24] that have been proposed. We choose the most practical and most secure of them [18,46,16], to include in the comparison.…”

Section: Related Workmentioning

confidence: 99%

A comparative evaluation of order-revealing encryption schemes and secure range-query protocols

2019

View full text Add to dashboard Cite

Database query evaluation over encrypted data can allow database users to maintain the privacy of their data while outsourcing data processing. Order-Preserving Encryption (OPE) and Order-Revealing Encryption (ORE) were designed to enable efficient query execution, but provide only partial privacy. More private protocols, based on Searchable Symmetric Encryption (SSE), Oblivious RAM (ORAM) or custom encrypted data structures, have also been designed. In this paper, we develop a framework to provide the first comprehensive comparison among a number of range query protocols that ensure varying levels of privacy of user data. We evaluate five ORE-based and five generic range query protocols. We analyze and compare them both theoretically and experimentally and measure their performance over database indexing and query evaluation. We report not only execution time but also I/O performance, communication amount, and usage of cryptographic primitive operations. Our comparison reveals some interesting insights concerning the relative security and performance of these approaches in database settings.

show abstract

Order-Revealing Encryption and the Hardness of Private Learning

Cited by 23 publications

References 55 publications

EncodeORE: Reducing Leakage and Preserving Practicality in Order-Revealing Encryption

EncodeORE: Reducing Leakage and Preserving Practicality in Order-Revealing Encryption

Practical Order-Revealing Encryption with Limited Leakage

A comparative evaluation of order-revealing encryption schemes and secure range-query protocols

Contact Info

Product

Resources

About