MetaCartSign in to MyCiteSeer

Include Citations | Advanced Search | Help

Include Citations | Advanced Search | Help

  Security proofs for signature schemes (1996) [184 citations — 22 self]

Download:
Download as a PDF | Download as a PS
by David Pointcheval, Jacques Stern
ftp://ftp.ens.fr/pub/dmi/users/pointche/eurocrypt96.ps
Add To MetaCart

Abstract:

Abstract. In this paper, we address the question of providing security proofs for signature schemes in the so-called random oracle model [1]. In particular, we establish the generality of this technique against adaptively chosen message attacks. Our main application achieves such a security proof for a slight variant of the El Gamal signature scheme [3] where committed values are hashed together with the message. This is a rather surprising result since the original El Gamal is, as RSA [11], subject to existential forgery. 1

Citations

2181 A method for obtaining digital signatures and public-key cryptosystems – Rivest, Shamir, et al. - 1978
1952 New Directions in Cryptography – Diffie, Hellman - 1976
974 Random oracles are practical: a paradigm for designing efficient protocols – Bellare, Rogaway - 1993
868 A public key cryptosystem and a signature scheme based on discrete logarithms – ElGamal - 1985
765 The knowledge complexity of interactive proof systems – Goldwasser, Micali, et al. - 1989
660 A digital signature scheme secure against adaptive chosen-message attacks – Goldwasser, Micali, et al. - 1988
601 How to prove yourself: Practical solutions to identification and signature problems – Fiat, Shamir - 1987
547 The MD5 Message-Digest Algorithm – RIVEST - 1992
260 New directions in cryptography – Die, Hellman - 1976
224 Efficient identification and signatures for smart cards – Schnorr - 1990
188 A public key cryptosystem and a signature scheme based on discrete logarithms – Gamal - 1985
169 A Practical Zero-Knowledge Protocol Fitted to Security Microprocessor Minimizing Both Transmission and Memory – Guillou, Quisquater - 1988
41 A new identification scheme based on syndrome decoding – Stern - 1994
26 An efficient identification scheme based on permuted kernels – Shamir - 1990
22 Ecient Identi and Signatures for Smart Cards – Schnorr - 1990
17 Designing identification schemes with keys of short size – Stern - 1994
11 A new identification scheme based on the perceptrons problem – Pointcheval - 1995
4 A New Identi Scheme Based on Syndrome Decoding – Stern - 1994
3 An Ecient Identi Scheme Based on Permuted Kernels – Shamir - 1990
2 A New Identi Scheme Based on the Perceptrons Problem – Pointcheval - 1995
2 Designing Identi Schemes with Keys of Short Size – Stern - 1994
View or Download | Add to My Collection | Correct Errors