Digital signature forgery

Known as: Selective forgery, Forgery (disambiguation), Existential forgery 
In a cryptographic digital signature or MAC system, digital signature forgery is the ability to create a pair consisting of a message, , and a… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2009
2009
Identifying the authenticity and integrity of digital images becomes increasingly important in digital forensics. In this paper… (More)
  • table I
  • table I
Is this relevant?
Highly Cited
2007
Highly Cited
2007
We describe a short signature scheme that is strongly existentially unforgeable under an adaptive chosen message attack in the… (More)
Is this relevant?
Highly Cited
2006
Highly Cited
2006
A signature system is said to be strongly unforgeable if the signature is existentially unforgeable and, given signatures on some… (More)
Is this relevant?
Highly Cited
2004
Highly Cited
2004
We describe a short signature scheme which is existentially unforgeable under a chosen message attack without using random… (More)
Is this relevant?
Highly Cited
2002
Highly Cited
2002
In this paper we propose an identity(ID)-based signature scheme using gap Diffie-Hellman (GDH) groups. Our scheme is proved… (More)
  • table 1
  • table 2
Is this relevant?
Highly Cited
2001
Highly Cited
2001
Motivated by emerging needs in online interactions, we define a new type of digital signature called a ‘Content Extraction… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2000
Highly Cited
2000
Since the appearance of public-key cryptography in the seminal Diffie—Hellman paper, many new schemes have been proposed and many… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1999
Highly Cited
1999
We present a new signature scheme which is existentially unforgeable under chosen message attacks, assuming some variant of the… (More)
  • figure 1
Is this relevant?
Highly Cited
1996
Highly Cited
1996
In this paper, we address the question of providing security proofs for signature schemes in the so-called random oracle model [1… (More)
Is this relevant?
Highly Cited
1990
Highly Cited
1990
Much research in theoretical cryptography has been centered around finding the weakest possible cryptographic assumptions… (More)
Is this relevant?