Efficient Solutions to Two-Party and Multiparty Millionaires’ Problem

Table 2

Computational complexities for the two-party GT problem.

Schemes	Result	Modular multiplications
Yao [1]		Exponential
Blake and Kolesnikov [25]
Lin and Tzeng [26]
Protocol 1

: bit number of inputs, : modulus of the public-key encryption scheme, and : encoding vector dimension.