On the Security of RSA Screening

  • Authors:
  • Jean-Sébastien Coron;David Naccache

  • Affiliations:
  • -;-

  • Venue:
  • PKC '99 Proceedings of the Second International Workshop on Practice and Theory in Public Key Cryptography
  • Year:
  • 1999

Quantified Score

Hi-index 0.01

Visualization

Abstract

Since many applications require the verification of large sets of signatures, it is sometimes advantageous to perform a simultaneous verification instead of checking each signature individually. The simultaneous processing, called batching, must be provably equivalent to the sequential verification of all signatures. In eurocrypt'98, Bellare et al. [1] presented a fast RSA batch verification scheme, called screening. Here we successfully attack this algorithm by forcing it to accept a false signature and repair it by implementing an additional test.