Chapter

Public-Key Cryptography – PKC 2013

Volume 7778 of the series Lecture Notes in Computer Science pp 292-311

Tighter Reductions for Forward-Secure Signature Schemes

  • Michel AbdallaAffiliated withLancaster UniversityDepartement d’Informatique, École normale supérieure
  • , Fabrice Ben HamoudaAffiliated withLancaster UniversityDepartement d’Informatique, École normale supérieure
  • , David PointchevalAffiliated withLancaster UniversityDepartement d’Informatique, École normale supérieure

* Final gross prices may vary according to local VAT.

Get Access

Abstract

In this paper, we revisit the security of factoring-based signature schemes built via the Fiat-Shamir transform and show that they can admit tighter reductions to certain decisional complexity assumptions such as the quadratic-residuosity, the high-residuosity, and the φ-hiding assumptions. We do so by proving that the underlying identification schemes used in these schemes are a particular case of the lossy identification notion recently introduced by Abdalla et al. at Eurocrypt 2012. Next, we show how to extend these results to the forward-security setting based on ideas from the Itkis-Reyzin forward-secure signature scheme. Unlike the original Itkis-Reyzin scheme, our construction can be instantiated under different decisional complexity assumptions and has a much tighter security reduction. Finally, we show that the tighter security reductions provided by our proof methodology can result in concrete efficiency gains in practice, both in the standard and forward-security setting, as long as the use of stronger security assumptions is deemed acceptable. All of our results hold in the random oracle model.