2 ms·
Is an ORE scheme implying that if you have some key, you have an efficient algorithm to sort through the plaintexts of a set of ciphertext. That would be faster
by baby 10y ago
Is an ORE scheme implying that if you have some key, you have an efficient algorithm to sort through the plaintexts of a set of ciphertext. That would be faster than decrypting them and comparing them all.
- schoen 10y agoTheir paper says > In our scheme there is a public algorithm that given two ciphertexts as input, reveals the order of the corresponding plaintexts and nothing else. It's not clear that this is "efficient"; it might be somewhat computationally intensive. But you can do it using only public information and without being able to decrypt the data.