Modulo reduction for paillier encryptions and application to secure statistical analysis

  • Authors:
  • Jorge Guajardo;Bart Mennink;Berry Schoenmakers

  • Affiliations:
  • Information and System Security Group, Philips Research, Eindhoven, The Netherlands;Dept. Electrical Engineering, ESAT/COSIC and IBBT, Katholieke Universiteit Leuven, Belgium;Dept. of Mathematics and Computer Science, Technische Universiteit Eindhoven, The Netherlands

  • Venue:
  • FC'10 Proceedings of the 14th international conference on Financial Cryptography and Data Security
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

For the homomorphic Paillier cryptosystem we construct a protocol for secure modulo reduction, that on input of an encryption x with x of bit length ℓx and a public ‘modulus’ a of bit length ℓa outputs an encryption $[[{x\bmod a}$]. As a result, a protocol for computing an encrypted integer division x div a is obtained. Surprisingly, efficiency of the protocol is independent of ℓx: the broadcast complexity of the protocol varies between O(nkℓa) and $O(n^2k\ell_a)$, for n parties and security parameter k, and it is very efficient in case of small ℓa (in practical cases ℓa often is much smaller than ℓx). Our protocol allows for efficient multiparty computation of statistics such as the mean, the variance and the median, and it is therefore very applicable to surveys for the benefit of statistical analysis.