A generalization and a variant of two threshold cryptosystems based on factoring

  • Authors:
  • Yvo Desmedt;Kaoru Kurosawa

  • Affiliations:
  • Department of Computer Science, University College London, UK;Department of Computer and Information Sciences, Ibaraki University, Japan

  • Venue:
  • ISC'07 Proceedings of the 10th international conference on Information Security
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

At Asiacrypt 2002, Katz and Yung presented two threshold cryptosystems based on factoring, a threshold version of Goldwasser-Micali's probabilistic encryption assuming that p = q = 3mod 4, and a threshold Rabin signature scheme assuming that p = 3 mod 8 and q = 7 mod 8. In this paper, we show a generalized condition on p and q to obtain a threshold version of Goldwasser-Micali, and a threshold Rabin-type signature scheme due to Kurosawa and Ogata [7] for p = q = 3 mod 4 and p + 1/4 = q + 1/4 mod gcd(p - 1, q - 1). Note that our set of (p, q) is disjoint from that of Katz-Yung threshold Rabin signature scheme.