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… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Committing integers and proving relations between them is an essential ingredient in many cryptographic protocols. Among them… (More)
  • table 1
  • table 2
  • figure 3
  • figure 4
Is this relevant?
2015
2015
In 2000, Cramer and Shoup presented a signature scheme which is secure against adaptive chosen-message attacks under the strong… (More)
Is this relevant?
2010
2010
Let N be the result of an RSA modulus generation, i.e., a random variable distributed according to some appropriate distribution… (More)
Is this relevant?
2010
2010
A proxy signature scheme is an important extension of the digital signature scheme, nowadays, is an active research topic, which… (More)
Is this relevant?
Highly Cited
2007
Highly Cited
2007
We describe a short signature scheme that is strongly existentially unforgeable under an adaptive chosen message attack in the… (More)
Is this relevant?
2007
2007
We propose an efficient digital signature scheme, which is proved secure under the strong RSA assumption, and can operate in an… (More)
Is this relevant?
2004
2004
In this paper, we provide the first committed signature provably secure in the standard complexity model based on the strong RSA… (More)
Is this relevant?
2003
2003
Key exposures bring out very serious problems in security services. Especially, it is more severe in the applications such as… (More)
Is this relevant?
Highly Cited
2002
Highly Cited
2002
We discuss a modification of the Cramer-Shoup strong-RSA signature scheme. Our proposal also presumes the strong RSA assumption… (More)
  • figure 1
Is this relevant?
Highly Cited
1999
Highly Cited
1999
We describe and analyze a new digital signature scheme. The new scheme is quite efficient, does not require the signer to… (More)
Is this relevant?