Skip to main content
Springer Nature Link
Log in
Menu
Find a journal Publish with us Track your research
Search
Cart
  1. Home
  2. Journal of Cryptology
  3. Article

Security Arguments for Digital Signatures and Blind Signatures

  • Published: 21 March 2000
  • Volume 13, pages 361–396, (2000)
  • Cite this article
Download PDF
Journal of Cryptology Aims and scope Submit manuscript
Security Arguments for Digital Signatures and Blind Signatures
Download PDF
  • David Pointcheval1 &
  • Jacques Stern1 
  • 6415 Accesses

  • 1670 Citations

  • 16 Altmetric

  • Explore all metrics

Abstract.

Since the appearance of public-key cryptography in the seminal Diffie—Hellman paper, many new schemes have been proposed and many have been broken. Thus, the simple fact that a cryptographic algorithm withstands cryptanalytic attacks for several years is often considered as a kind of validation procedure. A much more convincing line of research has tried to provide ``provable'' security for cryptographic protocols. Unfortunately, in many cases, provable security is at the cost of a considerable loss in terms of efficiency. Another way to achieve some kind of provable security is to identify concrete cryptographic objects, such as hash functions, with ideal random objects and to use arguments from relativized complexity theory. The model underlying this approach is often called the ``random oracle model.'' We use the word ``arguments'' for security results proved in this model. As usual, these arguments are relative to well-established hard algorithmic problems such as factorization or the discrete logarithm.

In this paper we offer security arguments for a large class of known signature schemes. Moreover, we give for the first time an argument for a very slight variation of the well-known El Gamal signature scheme. In spite of the existential forgery of the original scheme, we prove that our variant resists existential forgeries even against an adaptively chosen-message attack. This is provided that the discrete logarithm problem is hard to solve.

Next, we study the security of blind signatures which are the most important ingredient for anonymity in off-line electronic cash systems. We first define an appropriate notion of security related to the setting of electronic cash. We then propose new schemes for which one can provide security arguments.

Article PDF

Download to read the full article text

Similar content being viewed by others

Forward-Secure Digital Signature Schemes with Optimal Computation and Storage of Signers

Chapter © 2017

From One-Time to Two-Round Reusable Multi-signatures Without Nested Forking

Chapter © 2025

On the Impossibility of Purely Algebraic Signatures

Chapter © 2021

Explore related subjects

Discover the latest articles, books and news in related subjects, suggested using machine learning.
  • Cryptology
  • DNA computing and cryptography
  • Principles and Models of Security
  • Security Services
  • Security Science and Technology
  • Blockchain
Use our pre-submission checklist

Avoid common mistakes on your manuscript.

Author information

Authors and Affiliations

  1. Laboratoire d'Informatique, École Normale Supérieure, 75230 Paris Cedex 05, France [email protected], [email protected], http://www.di.ens.fr/~pointche, http://www.di.ens.fr/~stern , FR

    David Pointcheval & Jacques Stern

Authors
  1. David Pointcheval
    View author publications

    Search author on:PubMed Google Scholar

  2. Jacques Stern
    View author publications

    Search author on:PubMed Google Scholar

Additional information

Received 24 October 1997 and revised 22 May 1998

Rights and permissions

Reprints and permissions

About this article

Cite this article

Pointcheval, D., Stern, J. Security Arguments for Digital Signatures and Blind Signatures . J. Cryptology 13, 361–396 (2000). https://doi.org/10.1007/s001450010003

Download citation

  • Published: 21 March 2000

  • Issue date: June 2000

  • DOI: https://doi.org/10.1007/s001450010003

Share this article

Anyone you share the following link with will be able to read this content:

Sorry, a shareable link is not currently available for this article.

Provided by the Springer Nature SharedIt content-sharing initiative

  • Key words. Cryptography, Digital signatures, Blind signatures, Security arguments, Existential forgery, One-more forgery, Forking lemma.
Use our pre-submission checklist

Avoid common mistakes on your manuscript.

Advertisement

Search

Navigation

  • Find a journal
  • Publish with us
  • Track your research

Discover content

  • Journals A-Z
  • Books A-Z

Publish with us

  • Journal finder
  • Publish your research
  • Language editing
  • Open access publishing

Products and services

  • Our products
  • Librarians
  • Societies
  • Partners and advertisers

Our brands

  • Springer
  • Nature Portfolio
  • BMC
  • Palgrave Macmillan
  • Apress
  • Discover
  • Your US state privacy rights
  • Accessibility statement
  • Terms and conditions
  • Privacy policy
  • Help and support
  • Legal notice
  • Cancel contracts here

108.162.241.184

Not affiliated

Springer Nature

© 2025 Springer Nature