According to Protocol A that was presented in Section 3.1 paper entitled "Some Efficient Solutions to Yao’s Millionaire Problem" (2013). [1]
In that protocol they used an assumption that there is an encryption function that has the homomorphism property with respect to both additions (over some finite field) and bitwise XOR operations.
Can someone please send a reference to scheme that uphold the requirements?
My current candidate is to combine the answer in [2] and micali-goldwaser encryption [3].
But I don't know how (and if it possible) the scheme could work and overcome: (1) $N$ in GM cannot be a $Z_{2^q}$ as it's a multiplication of two primes. and (2) Is it possible to work with 2-complement binary representation ( To perform the subtraction operation).
[1]- https://arxiv.org/pdf/1310.8063v1.pdf
[2]- Homomorphic encryption based on XOR
[3]- https://en.wikipedia.org/wiki/Goldwasser%E2%80%93Micali_cryptosystem