Ronald Cramer, Ivan Damgård  Home/Search
Context Related
| brics.dk/RS/94/Ref...ICSRS9429.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: brics.dk/RS/94/Ref/BRICSRS94... (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: A method is proposed for constructing from interactive protocols digital signature schemes secure against adaptively chosen message attacks. Our main result is that practical secure signature schemes can now also be based on computationally difficult problems other than factoring (see [9]), such as the discrete logarithm problem. (Update)
Cited by: More
More Short Signatures without Random Oracles - Wei, Yuen (2006) (Correct)
Reactively Secure Signature Schemes - Backes, Pfitzmann, Waidner (2003) (Correct)
Low-level Ideal Signatures and General Integrity Idealization - Backes, Pfitzmann, Waidner (2004) (Correct)
Active bibliography (related documents): More All
0.8: New Generation of Secure and Practical RSA-based Signatures - Cramer, Damgård (1996) (Correct)
0.6: Proofs of Partial Knowledge and Simplified Design of.. - Cramer, Damgård.. (1995) (Correct)
0.5: On the Existence of Bit Commitment Schemes and Zero-Knowledge.. - Damgård (1989) (Correct)
Similar documents based on text: More All
0.9: Statistical Secrecy and Multi-Bit Commitments - Damgård, Pedersen, Pfitzmann (1996) (Correct)
0.9: Multiparty Computation from Threshold Homomorphic.. - Cramer, Damgård.. (2000) (Correct)
0.9: Verifiable Encryption and Applications to Group.. - Camenisch, Damgård (1998) (Correct)
Related documents from co-citation: More All
11: A Digital Signature Scheme Secure Against Adaptive Chosen Message Attack - Goldwasser, Micali et al. - 1988
9: New generation of secure and practical RSA-based signatures - Cramer, Damgard - 1996
7: Signature schemes based on the strong RSA assumption - Cramer, Shoup - 1998
BibTeX entry: (Update)
RS-94-29 Ronald Cramer and Ivan Damg ard. Secure Signature Schemes Based on Interactive Protocols. September 1994. http://citeseer.ist.psu.edu/cramer94secure.html More
@article{ cramer95secure,
author = "Ronald Cramer and Ivan Bjerre Damg{\aa}rd",
title = "Secure Signature Schemes based on Interactive Protocols",
journal = "Lecture Notes in Computer Science",
volume = "963",
pages = "297--??",
year = "1995",
url = "citeseer.ist.psu.edu/cramer94secure.html" }
Citations (may not include all citations):31 Rivest: A Digital Signature Scheme Secure Against Chosen Mes.. (context) - Goldwasser, Micali - 1988
17 Shamir: Zero-Knowledge Proofs of Identity (context) - Feige, Fiat - 1988
15 Quisquater: A Practical Zero-Knowledge Protocol fitted to Se.. (context) - Guillou
14 Journal of Cryptology (context) - Schnorr, Generation et al. - 1991
8 Shamir: Witness Indistinguishable and Witness Hiding Protoco.. (context) - Feige
7 Yung: Universal One-Way Hash Functions and their Cryptograph.. (context) - Naor
6 Springer Verlag LNCS series (context) - Damgard, Hash et al.
5 Hemachandra: On Generating Solved Instances of Computational.. (context) - Abadi, Allender et al.
4 Naor: An Efficient Existentially Unforgeable Signature Schem.. (context) - Dwork - 1994
3 Chaum: Provably Unforgeable Signatures (context) - Bos
2 Woll: Random Self-Reducibility and Zero-Knowledge Proof of I.. (context) - Tompa
1 Springer Verlag LNCS series (context) - Merkle, Signature et al.
1 Santa Barbara (context) - Okamoto, Secure et al. - 1992
1 Springer Verlag LNCS series (context) - Goldreich, concerning et al.
1 McCurley: An Interactive Identification Scheme Based on Disc.. (context) - Brickell - 1992
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.brics.dk/RS/94/Ref/BRICS-RS-94-Ref/): More
Decidability of Systems of Set Constraints with Negative.. - Aiken, Kozen, Wimmers (1994) (Correct)
A Fractal which violates the Axiom of Determinacy - Riis (1994) (Correct)
Complexity of Nondeterministic Functions - Andreev (1994) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC