Impossibility of Blind Signatures from One-Way Permutations

  • Jonathan Katz
  • Dominique Schröder
  • Arkady Yerukhimovich
Conference paper

DOI: 10.1007/978-3-642-19571-6_37

Part of the Lecture Notes in Computer Science book series (LNCS, volume 6597)
Cite this paper as:
Katz J., Schröder D., Yerukhimovich A. (2011) Impossibility of Blind Signatures from One-Way Permutations. In: Ishai Y. (eds) Theory of Cryptography. TCC 2011. Lecture Notes in Computer Science, vol 6597. Springer, Berlin, Heidelberg

Abstract

A seminal result in cryptography is that signature schemes can be constructed (in a black-box fashion) from any one-way function. The minimal assumptions needed to construct blind signature schemes, however, have remained unclear. Here, we rule out black-box constructions of blind signature schemes from one-way functions. In fact, we rule out constructions even from a random permutation oracle, and our results hold even for blind signature schemes for 1-bit messages that achieve security only against honest-but-curious behavior.

Download to read the full conference paper text

Copyright information

© International Association for Cryptologic Research 2011

Authors and Affiliations

  • Jonathan Katz
    • 1
  • Dominique Schröder
    • 2
  • Arkady Yerukhimovich
    • 1
  1. 1.University of MarylandUSA
  2. 2.Darmstadt University of TechnologyGermany

Personalised recommendations