Round Optimal Blind Signatures

  • Sanjam Garg
  • Vanishree Rao
  • Amit Sahai
  • Dominique Schröder
  • Dominique Unruh
Conference paper

DOI: 10.1007/978-3-642-22792-9_36

Part of the Lecture Notes in Computer Science book series (LNCS, volume 6841)
Cite this paper as:
Garg S., Rao V., Sahai A., Schröder D., Unruh D. (2011) Round Optimal Blind Signatures. In: Rogaway P. (eds) Advances in Cryptology – CRYPTO 2011. CRYPTO 2011. Lecture Notes in Computer Science, vol 6841. Springer, Berlin, Heidelberg

Abstract

Constructing round-optimal blind signatures in the standard model has been a long standing open problem. In particular, Fischlin and Schröder recently ruled out a large class of three-move blind signatures in the standard model (Eurocrypt’10). In particular, their result shows that finding security proofs for the well-known blind signature schemes by Chaum, and by Pointcheval and Stern in the standard model via black-box reductions is hard. In this work we propose the first roundoptimal, i.e., two-move, blind signature scheme in the standard model (i.e., without assuming random oracles or the existence of a common reference string). Our scheme relies on the Decisional Diffie Hellman assumption and the existence of sub-exponentially hard 1-to-1 one way functions. This scheme is also secure in the concurrent setting.

Copyright information

© International Association for Cryptologic Research 2011

Authors and Affiliations

  • Sanjam Garg
    • 1
  • Vanishree Rao
    • 1
  • Amit Sahai
    • 1
  • Dominique Schröder
    • 2
  • Dominique Unruh
    • 3
  1. 1.University of CaliforniaLos AngelesUSA
  2. 2.University of MarylandUSA
  3. 3.University of TartuEstonia

Personalised recommendations