Pointcheval–Stern signature algorithm

In cryptography, the Pointcheval–Stern signature algorithm is a digital signature scheme based on the closely related ElGamal signature scheme. It changes the ElGamal scheme slightly to produce an algorithm which has been proven secure in a strong sense against adaptive chosen-message attacks, assuming the discrete logarithm problem is intractable in a strong sense.D Pointcheval and J Stern. Security proofs for signature schemes. in U Maurer, ed. Adv in Crypt – Eurocrypt '96, 387–398, Springer-Verlag, 1996. Lect Notes in Comp Sci, nr 1070{{cite journal|last1=Pointcheval|first1=David|last2=Stern|first2=Jacques|title=Security Arguments for Digital Signatures and Blind Signatures|journal=Cryptology|date=2000|volume=13|issue=3|pages=361–396|doi=10.1007/s001450010003|s2cid=1912537|url=http://www.math.uni-frankfurt.de/~dmst/teaching/SS2012/Vorlesung/Point.Stern.pdf|access-date=2014-11-28|archive-date=2014-12-05|archive-url=https://web.archive.org/web/20141205031824/http://www.math.uni-frankfurt.de/~dmst/teaching/SS2012/Vorlesung/Point.Stern.pdf|url-status=dead}}

David Pointcheval and Jacques Stern developed the forking lemma technique in constructing their proof for this algorithm. It has been used in other security investigations of various cryptographic algorithms.