In general, given a message M, the digital signature of M generated by a signer S is a bit string univocally bound to M and some secret key known only by S. In practice, since digital signature schemes are based on asymmetric cryptography, the digital signature of M generated by S is a bit string dependent on M and the private key of S. Digital signature schemes have the property that signatures generated with a private key can be validated only by the corresponding public key. This ensures the authenticity of the message. Moreover, any modification on the signed message will invalidate the signature itself. This means that if the signature is validated it provides an evidence that the message has not been altered after the digital signature has been applied on it. This ensures the integrity of the message.
The notion of digital signature appeared in 1976 in a paper by Diffie and Hellman , where it has been introduced, for the...
- 2.Jonsson J, Kaliski B. Public-Key Cryptography Standards (PKCS) No. 1: RSA Cryptography. Request for Comments 3447, Feb 2003.Google Scholar
- 3.Kravitz DW. Digital signature algorithm. 1993. U.S. Patent No. 5, 231, 668.Google Scholar
- 4.Menezes AJ, van Oorschot PC, Vanstone SA. Handbook of applied cryptography. CRC; 1996.Google Scholar
- 5.Ntional Institute of Standards and Technology. Secure Hash Standard. Federal Information Processing Standards Publication, FIPS 180–1, 1995.Google Scholar
- 6.National Institute of Standards and Technology. Digital Signature Standard (DSS). Federal Information Processing Standards Publication, FIPS 186–2, 2000.Google Scholar
- 8.World Wide Web Consortium. XML-Signature Syntax and Processing. W3C Recommendation, 2002.Google Scholar