Improved Bounds on Security Reductions for Discrete Log Based Signatures

  • Sanjam Garg
  • Raghav Bhaskar
  • Satyanarayana V. Lokam
Conference paper

DOI: 10.1007/978-3-540-85174-5_6

Volume 5157 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
Garg S., Bhaskar R., Lokam S.V. (2008) Improved Bounds on Security Reductions for Discrete Log Based Signatures. In: Wagner D. (eds) Advances in Cryptology – CRYPTO 2008. CRYPTO 2008. Lecture Notes in Computer Science, vol 5157. Springer, Berlin, Heidelberg

Abstract

Despite considerable research efforts, no efficient reduction from the discrete log problem to forging a discrete log based signature (e.g. Schnorr) is currently known. In fact, negative results are known. Paillier and Vergnaud [PV05] show that the forgeability of several discrete log based signatures cannot be equivalent to solving the discrete log problem in the standard model, assuming the so-called one-more discrete log assumption and algebraic reductions. They also show, under the same assumptions, that, any security reduction in the Random Oracle Model (ROM) from discrete log to forging a Schnorr signature must lose a factor of at least \(\sqrt{q_h}\) in the success probability. Here qh is the number of queries the forger makes to the random oracle. The best known positive result, due to Pointcheval and Stern  [PS00], also in the ROM, gives a reduction that loses a factor of qh. In this paper, we improve the negative result from [PV05]. In particular, we show that any algebraic reduction in the ROM from discrete log to forging a Schnorr signature must lose a factor of at least \(q_h^{2/3}\), assuming the one-more discrete log assumption. We also hint at certain circumstances (by way of restrictions on the forger) under which this lower bound may be tight. These negative results indicate that huge loss factors may be inevitable in reductions from discrete log to discrete log based signatures.

Keywords

Provable Security Random Oracle Model Schnorr Signature Scheme 
Download to read the full conference paper text

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Sanjam Garg
    • 1
  • Raghav Bhaskar
    • 2
  • Satyanarayana V. Lokam
    • 2
  1. 1.IITDelhiIndia
  2. 2.Microsoft Research IndiaBangaloreIndia