• Home
  • Search
  • Message recovery for signature schemes based on the discrete logarithm problem
  • Cite Icon154
  • https://doi.org/10.1007/bf00125076Copy DOI Icon

Message recovery for signature schemes based on the discrete logarithm problem

Show More
  • Abstract
  • Literature Map
  • References
  • Citations
  • Similar Papers
Abstract

The new signature scheme presented by the authors in [13] is the first signature scheme based on the discrete logarithm problem that gives message recovery. The purpose of this paper is to show that the message recovery feature is independent of the choice of the signature equation and that all ElGamal-type schemes have variants giving message recovery. For each of the six basic ElGamal-type signature equations five variants are presented with different properties regarding message recovery, length of commitment and strong equivalence. Moreover, the six basic signature schemes have different properties regarding security and implementation. It turns out that the scheme proposed in [13] is the only inversionless scheme whereas the message recovery variant of the DSA requires computing of inverses in both generation and verification of signatures. In general, message recovery variants can be given for ElGamal-type signature schemes over any group with large cyclic subgroup as the multiplicative group of GF(2n) or elliptic curve over a finite field. The present paper also shows how to integrate the DLP-based message recovery schemes with secret session key establishment and ElGamal encryption. In particular, it is shown that with DLP-based schemes the same functionality as with RSA can be obtained. However, the schemes are not as elegant as RSA in the sense that the signature (verification) function cannot at the same time be used as the decipherment (encipherment) function.

Similar Papers
  • Conference Article
  • Citations19

An implementation of ElGamal elliptic curves cryptosystems

  • Nov 24, 1998
  • S Sutikno +2
  • PDF
  • Research Article
  • Citations2

New Collective Signatures Based on the Elliptic Curve Discrete Logarithm Problem

  • Jan 01, 2022
  • Computers, Materials & Continua
  • Tuan Nguyen Kim +2
  • Research Article
  • Citations16

An improved and provable self‐certified digital signature scheme with message recovery

  • Sep 24, 2013
  • International Journal of Communication Systems
  • Fan Wu +1
  • PDF
  • Book Chapter
  • Citations6

Elliptic Curve Cryptography and Point Counting Algorithms

  • Mar 07, 2012
  • Hailiza Kamarulhaili +1
  • Research Article
  • Citations130

Evidence that XTR Is More Secure than Supersingular Elliptic Curve Cryptosystems

  • Jul 30, 2004
  • Journal of Cryptology
  • Eric R Verheul
  • Book Chapter
  • Citations8

Public-Key Cryptosystems

  • Jan 01, 2003
  • Josef Pieprzyk +2
  • Research Article
  • Citations1

A NEW METHOD FOR CONSTRUCTING DIGITAL SIGNATURE SCHEME BASED ON NEW HARD PROBLEM

  • Dec 23, 2022
  • Journal of Science and Technique
  • The Truyen Bui
  • Conference Article
  • Citations19

Strong Designated Verifier Signature Scheme with Message Recovery

  • Feb 01, 2007
  • Ji-Seon Lee +1
  • Book Chapter
  • Citations2

An ID-Based Proxy Multi Signature Scheme without Bilinear Pairings

  • Jan 01, 2011
  • Namita Tiwari +1
  • Book Chapter

Cryptography and Lucas Sequence Discrete Logarithms

  • Jan 01, 2004
  • William A Webb
  • Research Article
  • Citations999

Elliptic Curve Cryptosystems

  • Jan 01, 1987
  • Mathematics of Computation
  • Neal Koblitz
  • Research Article
  • Citations29

A subexponential algorithm for discrete logarithms over hyperelliptic curves of large genus over GF( q)

  • Sep 01, 1999
  • Theoretical Computer Science
  • Leonard M Adleman +2
  • Research Article

Security of meta-He digital signature scheme based on factoring and discrete logarithms

  • Feb 12, 2005
  • Applied Mathematics and Computation
  • Zuhua Shao
  • Research Article
  • Citations4

A New Signature Scheme Based on Factoring and Discrete Logarithm Problems

  • Jul 22, 2012
  • International Journal of Information and Network Security (IJINS)
  • Swati Verma +1
  • Conference Article
  • Citations341

Reducing elliptic curve logarithms to logarithms in a finite field

  • Jan 01, 1991
  • Alfred Menezes +2
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.