Skip to search formSkip to main contentSkip to account menu

Strong RSA assumption

In cryptography, the strong RSA assumption states that the RSA problem is intractable even when the solver is allowed to choose the public exponent e… 
Wikipedia (opens in a new tab)

Related topics

Related topics

6 relations
Burt KaliskiCryptographyDigital signatureProvable security

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
ID Based Signature Scheme from Strong RSA Assumption in the Standard Model
ID based cryptography is always the interested field in the cryptography research, since it has the advantage of eliminating user… 
2011
2011
Proxy Multi-Signature Schemes Based on Strong RSA Assumption
Based on strong RSA assumption and the forking lemma,two proxy multi-signature schemes are presented,one is blind proxy multi… 
2007
2007
A Simple Secure Signature Scheme Based on the Strong RSA Assumption without Random Oracle Model
Summary In this paper, we present a simple secure signature scheme which is based on the Strong RSA Assumption without random… 
2007
2007
New signature scheme based on the strong RSA assumption
To promote the speed of the random signature generation and verification algorithms under the strong RSA hardness assumption,a… 
2007
2007
Variations on Pseudo-Free Groups
The notion of the pseudo-free group was informally introduced by Hohenberger [Hoh03], and was formalized by Rivest [Riv04a… 
2006
2006
A Stronger Definition for Anonymous Electronic Cash
We investigate definitions of security for previously proposed schemes for electronic cash and strengthen them so that the bank… 
2005
2005
Forward-secure Signature Scheme Based on Strong RSA Assumption
Recently, forward security has received a significant attention and has been extensively researched in the cryptographic… 
2002
2002
A Signature Scheme Based on the Strong RSA Assumption
For resisting the adaptive chosen message attack and improving the sign generation efficiency, a signature scheme based on the… 
2000
2000
Research in Cryptography , Information Security and Algorithm Development 9807-12 & 26 Progress Report : January 1 , 2001 – June 30 , 2001
Professor Goldwasser, together with Barak, Goldreich, and Lindell worked on Resettably-sound proofs and arguments. These concept… 
2000
2000
A group blind signature scheme based on the strong RSA assumption