R. Cramer and V. Shoup. Signature schemes based on the Strong RSA assumption. ACM Transactions on Information and System Security (ACM TISSEC) 3(3):161185, 2000. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
An Efficient System for Non-transferable Anonymous.. - Camenisch, Lysyanskaya (2001) (4 citations) (Correct)
....[ACJT00, CS97, CvH91, KP98] schemes. Prior to our work, the problem of constructing a practical system with multiple use credentials eluded researchers for some time [Bra99, Che95, Dam90, LRSW99] We solve it by extending ideas found in the constructions of strong RSA based signature schemes [CS99, GHR99] and group signature schemes [ACJT00] Our contribution. In Section 2 we present our definitions for a credential system with the basic properties. Although not conceptually new and inspired by the literature on multi party computation [Can95, Can00] and reactive systems [PW00] these definitions ....
Ronald Cramer and Victor Shoup. Signature schemes based on the strong rsa assumption. In Proc. 6th ACM Conference on Computer and Communications Security, pages 46--52. ACM press, nov 1999.
A Signature Scheme with Efficient Protocols - Camenisch, Lysyanskaya (2002) (2 citations) (Correct)
....are the RSA [32] the Fiat Shamir [21] and the Schnorr [34] signature schemes. However, ideal random functions cannot be implemented in the plain model [12] and therefore in the plain model, these signature schemes are not provably secure. Gennaro, Halevi, and Rabin [24] and Cramer and Shoup [16] proposed the first signature schemes whose e#ciency is suitable for practical use and whose security analysis does not assume an ideal random function. Their schemes are secure under the so called Strong RSA assumption. In contrast to these stand alone solutions, our goal is to construct ....
....is desirable to prove statements of the form I have a signature, and to obtain signatures on committed values. Our signature scheme is based on the Strong RSA assumption, and of all provably secure signatures known, it runs a close second in e#ciency to the signature scheme of Cramer and Shoup [16]. Our results can be thought of as a generalization of the anonymous credential system due to Camenisch and Lysyanskaya [7] and can also be viewed as a generalization of the Ateniese et al. 1] group signature scheme. In Section 2 we give the basic signature scheme, for which we give a proof of ....
R. Cramer and V. Shoup. Signature schemes based on the strong RSA assumption. In Proc. 6th ACM Conference on Computer and Communications Security, pages 46--52. ACM press, nov 1999.
An Identity Escrow Scheme with Appointed Verifiers - Camenisch, Lysyanskaya (2001) (5 citations) (Correct)
...., will be a quin tuple (s, Z, c, u, e) such that each of these values lies in the correct integer interval, u = a 0 a 4 ) holds, and c is the encryption of the value log Z mod n under V s public key. We show that such a certificate is hard to forge under the strong RSA assumption [3, 11, 23, 27, 28] and the assumption that computing discrete logarithms modulo a modulus of this form is hard. On the other hand, if c is not an encryption of log a3 Z mod n, then this certificate is easy to forge (Theorem 2) As V is the only entity that can check this, under the assumption that the Paillier ....
R. Cramer and V. Shoup. Signature schemes based on the strong RSA assumption. In Proc. 6th ACM CCS, pp. 46--52. ACM press, nov 1999.
Stateless-Recipient Certified E-mail System based on.. - Ateniese, Nita-Rotaru (2002) (1 citation) (Correct)
....above. Remark 4. The certified e mail protocol presented above works for RSA signatures but can easily be extended to work for other schemes based on a similar setting such as Rabin and Guillou Quisquater [16] signature schemes, or provably unforgeable signature schemes such as Cramer Shoup [10] and Gennaro HaleviRabin [15] In [3] it is shown how to extend the verifiable encryption protocol to work with such popular signature schemes. 4 Analysis and Comparisons In this section we present an analysis of our protocol and we compare it with the state of the art in the field. Our claim ....
R. Cramer and V. Shoup. Signature Schemes Based on the Strong RSA Assumption. In 6th ACM Conference on Computer and Communication Security, ACM Press, 1999.
An Efficient CDH-based Signature Scheme with a Tight.. - Chevallier-Mames (2005) Self-citation (Shoup) (Correct)
No context found.
R. Cramer and V. Shoup. Signature scheme based on the strong RSA assumption. ACM Transactions on Information and System Security, 3(3):161--185, 2000.
An Efficient CDH-based Signature Scheme with a Tight.. - Chevallier-Mames (2005) Self-citation (Shoup) (Correct)
No context found.
R. Cramer and V. Shoup. Signature scheme based on the strong RSA assumption. ACM Transactions on Information and System Security, 3(3):161--185, 2000.
Design and Analysis of Practical Public-Key Encryption Schemes .. - Cramer, Shoup (2001) (38 citations) Self-citation (Cramer Shoup) (Correct)
No context found.
R. Cramer and V. Shoup. Signature schemes based on the strong RSA assumption. ACM Transactions on Information and Systems Security, 3(3):161-185, 2000.
Practical Verifiable Encryption and Decryption of Discrete.. - Camenisch, Shoup (2003) (17 citations) Self-citation (Shoup) (Correct)
No context found.
R. Cramer and V. Shoup, Signature schemes based on the strong RSA assumption, ACM Transactions on Information and System Security 3 (2000), no. 3, 161--185.
Efficient Computation Modulo a Shared Secret with.. - Algesheimer.. (2002) (3 citations) Self-citation (Shoup) (Correct)
No context found.
Ronald Cramer and Victor Shoup. Signature schemes based on the strong RSA assumption. ACM Transactions on Information and System Security, 3(3):161--185, 2000.
Efficient Computation Modulo a Shared Secret with.. - Algesheimer.. (2002) (3 citations) Self-citation (Shoup) (Correct)
No context found.
Ronald Cramer and Victor Shoup. Signature schemes based on the strong RSA assumption. In Proc. 6th ACM Conference on Computer and Communications Security, pages 46--52. ACM press, nov 1999.
Independent Zero-Knowledge Sets - Rosario Gennaro And (2006) (Correct)
No context found.
R. Cramer and V. Shoup. Signature schemes based on the Strong RSA assumption. ACM Transactions on Information and System Security (ACM TISSEC) 3(3):161185, 2000.
Optimal Security Proofs for PSS and other Signature Schemes - Coron (2002) (16 citations) (Correct)
No context found.
R. Cramer and V. Shoup, Signature schemes based on the Strong RSA Assumption, May 9, 2000, revision of the extended abstract in Proc. 6th ACM Conf. on Computer and Communications Security, 1999; To appear, ACM Transactions on Information and System Security (ACM TISSEC). Available at http://www.shoup.net/
Optimal Asymmetric Encryption and Signature Paddings - Chevallier-Mames, al. (2005) (Correct)
No context found.
R. Cramer and V. Shoup. Signature Scheme based on the Strong RSA Assumption. In Proc. of the 6th CCS, pages 46--51. ACM Press, New York, 1999.
Twin Signatures: An Alternative to the - Hash-And-Sign Paradigm Published (Correct)
No context found.
R. Cramer, V. Shoup, Signature Scheme based on the Strong RSA Assumption, 6-th ACM conference on communications and computer security, pp. 46--51, 1999.
Designated Confirmer Signatures Revisited - Wikström (2006) (Correct)
No context found.
R. Cramer and V. Shoup. Signature schemes based on the strong RSA assumption. In 6th ACM Conference on Computer and Communications Security (CCS), pages 4651. ACM Press, 1999.
Use of Sparse and/or Complex Exponents in Batch Verification of .. - Cheon, Lee (2005) (Correct)
No context found.
R. Cramer and V. Shoup, "Signature Schemes based on the Strong RSA Assumptions, " ACM TISSEC, Vol. 3, No. 3, pp.161--185, 2000. A preliminary version appeared in Proc. of Crypto'89, LNCS Vol. 435, pp. 175--185, Springer-Verlag, 1989.
A New Short Signature Scheme without Random Oracles from.. - Zhang, Chen, Susilo, Mu (2005) (1 citation) (Correct)
No context found.
R. Cramer and V. Shoup, Signature schemes based on the strong RSA assumption, The Sixth ACM Conference on Computer and Communications Security, pp.46-52, ACM press, 1999.
Optimal Security Proofs for PSS and other Signature Schemes - Coron (2002) (16 citations) (Correct)
No context found.
R. Cramer and V. Shoup, Signature schemes based on the Strong RSA Assumption, May 9, 2000, revision of the extended abstract in Proc. 6th ACM Conf. on Computer and Communications Security, 1999; To appear, ACM Transactions on Information and System Security (ACM TISSEC). Available at http://www.shoup.net/
More Short Signatures without Random Oracles - Wei, Yuen (2006) (Correct)
No context found.
R. Cramer and V. Shoup. Signature schemes based on the strong RSA assumption. In ACM CCS99, pages 161--185,
Optimal Asymmetric Encryption and Signature Paddings - Chevallier-Mames, al. (2005) (Correct)
No context found.
R. Cramer and V. Shoup. Signature Scheme based on the Strong RSA Assumption. In Proc. of the 6th CCS, pages 46--51. ACM Press, New York, 1999.
Twin Signatures: An Alternative to the - Hash-And-Sign Paradigm Published (Correct)
No context found.
R. Cramer, V. Shoup, Signature Scheme based on the Strong RSA Assumption, 6-th ACM conference on communications and computer security, pp. 46--51, 1999.
Efficient Group Signatures without Trapdoors - Ateniese, de Medeiros (2002) (1 citation) (Correct)
No context found.
R. Cramer and V. Shoup. Signature schemes based on the strong RSA assumption. ACM Transactions on Information and System Security (TISSEC), 3(3):161--185, 2000.
Yet Another Short Signatures without Random Oracles from.. - Zhang, Chen (2005) (Correct)
No context found.
R. Cramer and V. Shoup, Signature schemes based on the strong RSA assumption, The Sixth ACM Conference on Computer and Communications Security, pp.46-52, ACM press, 1999.
The One-More-RSA-Inversion Problems and the.. - Bellare.. (2001) (10 citations) (Correct)
No context found.
R. Cramer and V. Shoup. Signature schemes based on the strong RSA assumption. In Proceedings of the 6th ACM conference on Computer and communications security, pages 46-51. ACM Press, November 1999.
An Efficient CDH-based Signature Scheme with a Tight.. - Chevallier-Mames (2005) (Correct)
No context found.
R. Cramer and V. Shoup. Signature scheme based on the strong RSA assumption. ACM Transactions on Information and System Security, 3(3):161--185, 2000.
Automatic Generation of Two-Party Computations (Extended.. - MacKenzie, Oprea, Reiter (2003) (Correct)
No context found.
R. Cramer and V. Shoup. Signature schemes based on the strong RSA assumption. ACM Transactions on Information and System Security 3(3):161--185, 2000.
Efficient and Optimistic Fair Exchanges Based on Standard.. - Zhang, Zhou, Feng (2004) (Correct)
No context found.
R. Cramer, V. Shoup. Signature Schemes Based on the Strong RSA Assumption. ACM Transactions on Information and System Security, Vol. 3, No. 3, pages 161-185, August 2000.
Hierarchical Group Signatures - Trolin, Wikström (2004) (Correct)
No context found.
R. Cramer and V. Shoup. Signature schemes based on the strong RSA assumption. In 6th ACM Conference on Computer and Communications Security (CCS), pages 46--51. ACM Press, 1999.
Direct Anonymous Attestation - Brickell, Camenisch, Chen (2004) (13 citations) (Correct)
No context found.
R. Cramer and V. Shoup. Signature schemes based on the strong RSA assumption. ACM Transactions on Information and System Security, 3(3):161--185, 2000.
Optimal Security Proofs for PSS and other Signature Schemes - Coron (2001) (16 citations) (Correct)
No context found.
R. Cramer and V. Shoup, Signature schemes based on the Strong RSA Assumption, May 9, 2000, revision of the extended abstract in Proc. 6th ACM Conf. on Computer and Communications Security, 1999; To appear, ACM Transactions on Information and System Security (ACM TISSEC). Available at http://www.shoup.net/
Twin Signatures: An Alternative to the Hash-and-Sign.. - Naccache, Pointcheval.. (2001) (2 citations) (Correct)
No context found.
R. Cramer, V. Shoup, Signature Scheme based on the Strong RSA Assumption, 6-th ACM conference on communications and computer security, pp. 46--51, 1999.
Optimal Security Proofs for PSS and other Signature Schemes - Coron (2002) (16 citations) (Correct)
No context found.
R. Cramer and V. Shoup, Signature schemes based on the Strong RSA Assumption, May 9, 2000, revision of the extended abstract in Proc. 6th ACM Conf. on Computer and Communications Security, 1999; To appear, ACM Transactions on Information and System Security (ACM TISSEC). Available at http://www.shoup.net/
Direct Anonymous Attestation - Brickell, Camenisch, Chen (2004) (13 citations) (Correct)
No context found.
R. Cramer and V. Shoup. Signature schemes based on the strong RSA assumption. ACM Transactions on Information and System Security, 3(3):161--185, 2000.
The Security of Practical Two-Party RSA Signature Schemes - Bellare, Sandhu (2001) (6 citations) (Correct)
No context found.
R. Cramer and V. Shoup. Signature schemes based on the strong RSA assumption. ACM Transactions on Information and System Security, 3(3):161-185, Aug. 2000.
Optimal Security Proofs for PSS and other Signature Schemes - Coron (2002) (16 citations) (Correct)
No context found.
R. Cramer and V. Shoup, Signature schemes based on the Strong RSA Assumption, May 9, 2000, revision of the extended abstract in Proc. 6th ACM Conf. on Computer and Communications Security, 1999; To appear, ACM Transactions on Information and System Security (ACM TISSEC). Available at http://www.shoup.net/
Twin Signatures: An Alternative to the Hash-and-Sign.. - Naccache, Pointcheval.. (2001) (2 citations) (Correct)
No context found.
R. Cramer, V. Shoup, Signature Scheme based on the Strong RSA Assumption, 6-th ACM conference on communications and computer security, pp. 46--51, 1999.
Blind, Auditable Membership Proofs - Sander, Ta-Shma, Yung (2000) (1 citation) (Correct)
No context found.
R. Cramer and V. Shoup. Signature schemes based on the strong RSA assumption. In Proceedings of the 6e ACM Conference on Computer and Communications Security.ACM Press, 1999.
A Composable Cryptographic Library with Nested.. - Backes, Pfitzmann.. (2003) (23 citations) (Correct)
No context found.
R. Cramer and V. Shoup. Signature schemes based on the strong RSA assumption. In Proc. 6th ACM Conference on Computer and Communications Security, pages 46--51, 1999.
Efficient and Universally Composable Committed Oblivious.. - Garay, MacKenzie, Yang (2004) (1 citation) (Correct)
No context found.
R. Cramer and V. Shoup. Signature scheme based on the strong RSA assumption. In ACM Transactions on Information and System Security (ACM TISSEC) 3(3):161-185, 2000.
Multicast Authentication in Fully Adversarial Networks - Anna Lysyanskaya Roberto (Correct)
No context found.
R. Cramer and V. Shoup. Signature schemes based on the strong RSA assumption. In Proc. 6th ACM Conference on Computer and Communications Security, pages 46--52. ACM press, nov 1999.
Optimal Security Proofs for PSS and other Signature Schemes - Coron (2002) (16 citations) (Correct)
No context found.
R. Cramer and V. Shoup, Signature schemes based on the Strong RSA Assumption, May 9, 2000, revision of the extended abstract in Proc. 6th ACM Conf. on Computer and Communications Security, 1999; To appear, ACM Transactions on Information and System Security (ACM TISSEC). Available at http://www.shoup.net/
Efficient and Universally Composable Committed Oblivious.. - Garay, MacKenzie, Yang (2004) (1 citation) (Correct)
No context found.
R. Cramer and V. Shoup. Signature scheme based on the strong RSA assumption. In ACM Transactions on Information and System Security (ACM TISSEC) 3(3):161-185, 2000.
Intrusion-Resilient Key-Evolving Schnorr Signature - Kim, Kim (2003) (Correct)
No context found.
R. Cramer and V. Shoup, "Signature schemes based on the strong RSA assumption", ACM Transactions on Information and System Security, 3(3):161-185, 2000.
On Simulation-Sound Trapdoor Commitments - MacKenzie, Yang (2003) (5 citations) (Correct)
No context found.
R. Cramer and V. Shoup. Signature scheme based on the strong RSA assumption. In ACM Trans. on Information and System Security 3(3):161-185, 2000.
Fine-Grained Forward-Secure Signature Schemes without.. - Camenisch, Koprowski (2003) (Correct)
No context found.
R. Cramer, V. Shoup, Signature schemes based on the strong RSA assumption, in: ACM Conference on Computer and Communications Security, 1999, pp. 46--51.
A Provably Secure Nyberg-Rueppel Signature Variant with.. - Ateniese, de Medeiros (2004) (Correct)
No context found.
Cramer, R., and Shoup, V. Signature schemes based on the strong RSA assumption. ACM Transactions on Information and System Security 3(3) (2000), 161--185.
Twin Signatures: An Alternative to the Hash-and-Sign Paradigm - Naccache, Pointcheval, al. (2001) (2 citations) (Correct)
No context found.
R. Cramer, V. Shoup, Signature Scheme based on the Strong RSA Assumption, 6-th ACM conference on communications and computer security, pp. 46--51, 1999.
Transitive Signatures Based on Non-adaptive Standard Signatures - Sujing (2004) (Correct)
No context found.
R. Cramer and V. Shoup, "Signature schemes based on the strong RSA assumption," in Proc. of the 6th ACM Conf. on Computer and Communications Security(CCS '99), pp. 46--52, ACM Press, 1999.
Multi-trapdoor Commitments and their Applications to Proofs of.. - Gennaro (2004) (3 citations) (Correct)
No context found.
R. Cramer and V. Shoup. Signature schemes based on the Strong RSA assumption. Proc. of ACM Conference on Computer and Communication Security 1999.
Efficient Group Signatures without Trapdoors - Ateniese, de Medeiros (2002) (1 citation) (Correct)
No context found.
R. Cramer and V. Shoup. Signature schemes based on the strong RSA assumption. ACM Transactions on Information and System Security (TISSEC), 3(3):161--185, 2000.
First 50 documents Next 50
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