Homomorphic encryption and secure comparison

We propose a protocol for secure comparison of integers based on homomorphic. We also propose a homomorphic encryption scheme that can be used in our protocol, makes it more efficient than previous solutions, and can also be used as the basis of efficient and general secure Multiparty Computation (MPC). We show how our comparison protocol can be used to improve security of online auctions, and demonstrate that it is efficient enough to be used in practice. For comparison of 16 bits numbers with security based on 1024 bits RSA (executed by two parties), our implementation takes 0. 28 sec including all computation and communication. Using precomputation, one can save a factor of roughly 10.