Advances in Cryptology — ASIACRYPT '96

Volume 1163 of the series Lecture Notes in Computer Science pp 252-265


Provably secure blind signature schemes

  • David PointchevalAffiliated withÉcole Normale Supérieure, Laboratoire d'Informatique
  • , Jacques SternAffiliated withÉcole Normale Supérieure, Laboratoire d'Informatique

* Final gross prices may vary according to local VAT.

Get Access


In this paper, we give a provably secure design for blind signatures, the most important ingredient for anonymity in off-line electronic cash systems. Previous examples of blind signature schemes were constructed from traditional signature schemes with only the additional proof of blindness. The design of some of the underlying signature schemes can be validated by a proof in the so-called random oracle model, but the security of the original signature scheme does not, by itself, imply the security of the blind version. In this paper, we first propose a definition of security for blind signatures, with application to electronic cash. Next, we focus on a specific example which can be successfully transformed in a provably secure blind signature scheme.