I'm curious about what operations have been developed into functional encryption schemes. What I mean by that is: what operations can be performed over encrypted ciphertexts? Obviously homomorphic ...
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?
How can I ensure order of encrypted data i.e., Enc(m1) < Enc(m2) where m1 < m2, and all messages are integer values. I have gone through Order Preserving ...