Pointcheval-Stern signature algorithm
- 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-plaintext attacks. That is, if 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); and D Pointcheval and J Stern, Security arguments for digital signatures and blind signatures, J Crypt 13(3):361-396, 2000.)
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.
Wikimedia Foundation.
2010.
Look at other dictionaries:
Digital signature — This article is about secure cryptographic signatures. For simple signatures in digital form, see Electronic signature. A digital signature or digital signature scheme is a mathematical scheme for demonstrating the authenticity of a digital… … Wikipedia
Jacques Stern — (born 1949) is a cryptographer, currently a professor at the École Normale Supérieure, where he is Director of the Computer Science Laboratory. He received the 2006 CNRS Gold Medal. His notable work includes the cryptanalysis of numerous… … Wikipedia
E-imza — This article concerns cryptographic signatures. For signatures in digital form, see electronic signature. In cryptography, a digital signature or digital signature scheme is a type of asymmetric cryptography used to simulate the security… … Wikipedia
Электронная цифровая подпись — Стиль этой статьи неэнциклопедичен или нарушает нормы русского языка. Статью следует исправить согласно стилистическим правилам Википедии. Электронная подпись (ЭП) информация в электронной форме, присоединенная к другой информации в электронной… … Википедия
Forking lemma — The forking lemma is any of a number of related lemmas in cryptography research. The lemma states that if an adversary (typically a probabilistic Turing machine), on inputs drawn from some distribution, produces an output that has some property… … Wikipedia
Optimal asymmetric encryption padding — This article is about the padding scheme used in public key cryptography. For the division of the Thailand Ministry of Science Technology and Environment entitled Office of Atomic Energy for Peace, see [1]. In cryptography, Optimal Asymmetric… … Wikipedia
