Ronald Cramer, Victor Shoup  Home/Search
Context Related
| iacr.org/1999/001.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: iacr.org/complete/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We describe and analyze a new digital signature scheme. The new scheme is quite efficient, does not require the the signer to maintain any state, and can be proven secure against adaptive chosen message attack under a reasonable intractability assumption, the so-called strong RSA assumption. Moreover, a hash function can be incorporated into the scheme in such a way that it is also secure in the random oracle model under the standard RSA assumption. (Update)
Similar documents based on text: More All
0.6: Signature Schemes Based on the Strong RSA Assumption - Cramer, Shoup (1999) (Correct)
0.3: A Practical Public Key Cryptosystem Provably Secure against.. - Cramer, Shoup (1998) (Correct)
0.2: The Cramer-Shoup Strong-RSA Signature Scheme Revisited - Fischlin (2002) (Correct)
Related documents from co-citation: More All
60: Secure hash-and-sign signatures without the random oracle - Gennaro, Halevi et al. - 1999
46: A Digital Signature Scheme Secure Against Adaptive Chosen Message Attack - Goldwasser, Micali et al. - 1988
41: Random Oracles are Practical: a Paradigm for Designing Efficient Protocols - Bellare, Rogaway - 1993
BibTeX entry: (Update)
R. Cramer and V. Shoup. Signature schemes based on the strong RSA assumption. IBM Research Report RZ 3083, 1998. http://citeseer.ist.psu.edu/cramer99signature.html More
@article{ cramer00signature,
author = "Ronald Cramer and Victor Shoup",
title = "Signature Schemes Based on the Strong {RSA} Assumption",
journal = "ACM Transactions on Information and System Security",
volume = "3",
number = "3",
pages = "161--185",
year = "2000",
url = "citeseer.ist.psu.edu/cramer99signature.html" }
Citations (may not include all citations):659 Random oracles are practical: a paradigm for designing effic.. - Bellare, Rogaway - 1993
116 Algorithmic Number Theory (context) - Bach, Shallit - 1996
101 Collision-free accumulators and fail-stop signature schemes .. - Bari'c, Pfitzmann - 1997
45 Collision-resistant hashing: towards making UOWHFs practical (context) - Bellare, Rogaway - 1997
4 Efficiency and security of cryptosystems based on number the.. - Bleichenbacher - 1996
2 New primality criteria and factorizations (context) - Brillhart, Lehmer et al.
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://eprint.iacr.org/complete/): More
A Tool for Obtaining Tighter Security Analyses of.. - Bellare, Impagliazzo (1999) (Correct)
Chameleon Hashing and Signatures - Krawczyk, Rabin (1997) (Correct)
Verifiable Encryption and Applications to Group.. - Camenisch, Damgård (1999) (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