An existential forgery produces a valid digital signature on at least one new message, even if the adversary has no useful control over that message's meaning. A universal forgery gives a way to forge a digital signature on an arbitrary specified message. Recovering the private key suffices for a universal forgery, but is not required if another general signing method exists.
In a key-only signature attack, the adversary knows the verification public key and the public scheme. In a known-message signature attack, it additionally obtains valid message–digital signature pairs whose messages it did not choose. In a chosen-message signature attack, it can ask for digital signatures on messages it chooses, possibly adaptively. Its final forged message must not be one of the messages already submitted for signing; otherwise simply returning a supplied pair would count as a forgery.
A failure of collision resistance supplies distinct messages withAsk the legitimate signer to sign , obtaining . Output without ever requesting a digital signature on . Its verification succeeds becauseThusThe adversary chooses the collision pair, but cannot in general insist that one member equal an independently specified target. A known-message signature attack would require the stronger ability to collide with an already signed message; finding an arbitrary collision alone does not provide that.
The stated ability is a complete failure of second-preimage resistance. Given an arbitrary target message , compute with . Ask the signer for a digital signature on only, obtaining . Thenso is a forgery of the chosen target. The inequality ensures that the adversary has not requested the target's own digital signature.
Under a known-message signature attack, the same weakness also gives an existential forgery: take an observed signed , find its different second preimage, and reuse the digital signature. The universal forgery claim uses the stronger chosen-message signature attack capability to request the companion of whichever target was specified.