The 2024 Developer Survey results are live! See the results

# Questions tagged [order-preserving]

Order-preserving encryption (OPE) is a method of encrypting data so that it's possible to make efficient inequality comparisons on the encrypted items without using the key (including, but not limited to, using the key to decrypt the encrypted items).

28 questions
Filter by
Sorted by
Tagged with
71 views

### Is Order-preserving encryption part of the functional encryption family?

I believe I know quite well OPE and ORE, but I'm unsure about what family to put them in. Can we consider them as a sub family of Functional Encryption, like Attribute Based Encryption or Inner ...
• 58
1 vote
46 views

### How hypergeometric sampling works in order preserving encryption?

According to https://crypto.stackexchange.com/a/8800/53007: Start with the entire domain [M] and range [N]. Call y←N/2 our range gap. Now using our key k we generate some pseudorandom coins and give ...
• 71
1 vote
103 views

### Understanding this notation for the probability distribution of order preserving encryption

I'm reading this PDF: https://link.springer.com/content/pdf/10.1007/978-3-642-01001-9_13.pdf about order preserving encryption functions and there's this on page 9 (or 232): It's describing the ...
56 views

### Comparing two private values and extracting the ciphertext corresponding to the minimum value

How can I solve this problem: I have a directed graph of nodes that can be malicious and all of them have a private value. Consider a node "B" with private value "BPrivateValue = b&...
297 views

### Does asymmetric order-preserving encryption exist?

As I understand from this post, mapping from plaintext space to ciphertext space is the fundamental point of all order-preserving encryption. So the only way that we let someone encrypt an arbitrary ...
147 views

### NIZK proof for Order-preserving encryption

Suppose a cipher c=Enc(K,m), where Enc() is the order-preserving encryption scheme. Can NIZK be used to prove that c does indeed encrypt m? The Schnorr NIZK is based on discrete logarithms equality. I ...
18 views

### Order preserving hashes [duplicate]

Are there hash functions that dynamically take integers a and b, and output h(a) and h(b) such that if a>b we have h(a) > h(b)?
1 vote
105 views

### is OPE able to produce different cyphertext for same plaintext?

Given a plaintext p, is OPE (Boldyreva et al.) able to produce n different cyphertext c1...cn for the n occurrences of p? If not, there exists an order-preserving encryption scheme able to do that?
• 11
136 views

### Are large polynomials secure for order preserving "hashing"? (newbie question)

I've been searching for some time now for an answer to this simple question: if I have a large polynomial that is secret, and I use it to transform a set of integers so as to obtain a new set that ...
• 183
3k views

### Applying machine learning algorithms to homomorphic encrypted data

I have a basic understanding of encryption and I got back to the topic because of an interesting site that encrypts financial data using homomorphic encryption (HE) and I would be happy for any input ...
• 163
2k views

### Order-Preserving Encryption (OPE) and leakage

I recently came across OPE and Order-Revealing Encryption (ORE), but I didn't exactly got the idea why they are important. What's exactly important about them? Are they actually used in practice? My ...
• 819
628 views

### How does order-preserving encryption work on string?

I have read “How does order-preserving encryption work?”. After that, I completed order-preserving encryption on integer data. Now, I have four questions in this subject: Is it possible to apply sum ...
• 183
158 views

### Understanding the definition of HGD

On the section 4.2, page 10, of the paper Order-Preserving Symmetric Encryption, the authors define two subroutines: the first one is called $HGD$ and the second one is $GetCoins$. I have doubts ...
435 views

### Additively homomorphic cryptosystem with non-interactive zero-knowledge proof of non-negativity

I need a cryptosystem that is additively homomorphic. Paillier preferably, but not neccessarily. Also, for every ciphertext the private key holder must be able to prove non-interactively that the ...
• 285
1 vote
89 views

### Applying Vigenere on small strings with sorting capability

I am new to cryptography and have a question about a use of Vigenere cipher in the case of small strings. I'd like to encrypt keywords that are smaller than 10 characters. If I use Vigenere ...
• 11
895 views

### Is it secure to use order preserving encryption in practice?

When I read papers, I often see the comments, "order-preserving encryption is deterministic and it is not IND-CPA secure", or in general "it is not secure enough to be implemented in practice". So I ...
• 163
823 views

### What is matrix branching program?

Recently I am reading something about order-revealing encryption (by Boneh at al. in EuroCrypt 2015) and encountered "matrix branching programming". It seems like it took me forever to understand this....
• 163
318 views

### Weakening of Paillier cryptosystem due to ciphertext equivalence and order in CryptDB

The Paillier cryptosystem is probabilistic in nature and IND-CPA secure. By design given two ciphertexts one cannot distinguish whether decrypting those two ciphertexts will result in same or ...
• 6,204
1 vote
46 views

• 6,210
1k views

### In the Paillier cryptosystem, is there a method to judge whether an encrypted number is less than 0 (without the private key)

Or, is there a cryptosystem that is both order-perserving and additive homomorphic?
• 629
19k views

### How does order-preserving encryption work?

Order-preserving encryption (OPE) is, apparently, a method of encrypting data so that it's possible to make efficient inequality comparisons on the encrypted items without decrypting them. I've been ...
• 46.3k