Ronald Cramer, Victor Shoup  Home/Search
Context Related
Links: ACM DBLP | wisc.edu/~shoup/papers/sig.ps.Z inf.ethz.ch/personal/cramer/pa...sig.ps inf.ethz.ch/pub/publication...CrSh99.ps 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: counterpane.com/b...allauthorsS (more) From: inf.ethz.ch/personal/cramer/ (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. 1 Introduction We describe new, efficient... (Update)
Cited by: More
Independent Zero-Knowledge Sets - Rosario Gennaro And (2006) (Correct)
Optimal Security Proofs for PSS and other Signature Schemes - Coron (2002) (Correct)
Optimal Asymmetric Encryption and Signature Paddings - Chevallier-Mames, al. (2005) (Correct)
Similar documents (at the sentence level):
41.0%: Signature Schemes Based on the Strong RSA Assumption - Cramer, Shoup (1999) (Correct)
Active bibliography (related documents): More All
0.3: Stateless-Recipient Certified E-mail System based on.. - Ateniese, Nita-Rotaru (2002) (Correct)
0.2: Minding Your P's and Q's - Anderson, Vaudenay (1996) (Correct)
0.1: Fast Generation of Prime Numbers and Secure Public-Key.. - Maurer (1994) (Correct)
Similar documents based on text: More All
0.8: Comparison of two signature schemes based on the RSA assumption - Martinet (2001) (Correct)
0.7: The Cramer-Shoup Strong-RSA Signature Scheme Revisited - Fischlin (2002) (Correct)
0.5: A Secure Signature Scheme from Bilinear Maps - Boneh, Mironov, Shoup (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/article/cramer98signature.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/article/cramer98signature.html" }
Citations (may not include all citations):659 Random oracles are practical: a paradigm for designing effic.. - Bellare, Rogaway - 1993 DBLP
501 A digital signature scheme secure against adaptive chosen-me.. - Goldwasser, Micali et al. - 1988 ACM DBLP
122 A practical zero-knowledge protocol fitted to security micro.. (context) - Guillou, Quisquater - 1988
116 Algorithmic Number Theory (context) - Bach, Shallit - 1996 ACM
101 Collision-free accumulators and fail-stop signature schemes .. - Bari'c, Pfitzmann - 1997 DBLP
78 Probabilistic algorithms for testing primality (context) - Rabin - 1980
45 Collision-resistant hashing: towards making UOWHFs practical (context) - Bellare, Rogaway - 1997 DBLP
36 More flexible exponentiation with precomputation - Lim, Lee - 1994 ACM DBLP
32 New generation of secure and practical RSA-based signatures - Cramer, Damgard - 1996 ACM DBLP
24 Fast generation of prime numbers and secure public-key crypt.. - Maurer - 1995 DBLP
10 Theory of Cryptography Library (context) - Krawczyk, Rabin et al. - 1998
6 The probability that a random probable prime is composite (context) - Kim, Pomerance - 1989
4 Efficiency and security of cryptosystems based on number the.. - Bleichenbacher - 1996
3 without trees or random oracles (context) - Gennaro, Halevi et al. - 1998
2 An efficient existentially unforegeable signature scheme and.. (context) - Dwork, Naor - 1994
1 Infinite sets of primes with fast primality tests and quick .. (context) - Pintz, Steiger et al. - 1989
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.counterpane.com/biblio/all-authors-S.html): More
A New Practical Algorithm for the Construction of a Perfect .. - Atici, Stinson, Wei (Correct)
Experimental Quantum Cryptography - Bennett, Bessette, Brassard.. (1992) (Correct)
Almost k-wise Independent Sample Spaces and Their.. - Kurosawa, Johansson.. (2001) (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