Threshold properties of prime power subgroups with application to secure integer comparisons

Abstract

We present a semantically secure somewhat homomorphic public-key cryptosystem working in sub-groups of (formula presented) of prime power order. Our scheme introduces a novel threshold homomorphic property, which we use to build a two-party protocol for secure integer comparison. In contrast to related work which encrypts and acts on each bit of the input separately, our protocol compares multiple input bits simultaneously within a single ciphertext. Compared to the related protocol of Damgård et al. [9, 10] we present results showing this approach to be both several times faster in computation and lower in communication complexity.