Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
The TLS 1.3 0-RTT mode enables a client reconnecting to a server to send encrypted application-layer data in “0-RTT” (“zero round… Expand
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • table 2
Is this relevant?
2016
2016
Committing integers and proving relations between them is an essential ingredient in many cryptographic protocols. Among them… Expand
  • figure 1
  • figure 3
  • table 1
  • table 2
  • figure 4
Is this relevant?
2013
2013
The notion of pseudo-freeness of a group was introduced by Hohenberger, and formalized by Rivest in order to unify cryptographic… Expand
Is this relevant?
Highly Cited
2010
Highly Cited
2010
The signature schemes described in the previous chapter have the advantage of being based on very weak cryptographic assumptions… Expand
Is this relevant?
Highly Cited
2007
Highly Cited
2007
Abstract We describe a short signature scheme that is strongly existentially unforgeable under an adaptive chosen message attack… Expand
Is this relevant?
2004
2004
  • Huafei Zhu
  • Public Key Cryptography
  • 2004
  • Corpus ID: 10871440
In this paper, we provide the first committed signature provably secure in the standard complexity model based on the strong RSA… Expand
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… Expand
Is this relevant?
2002
2002
For resisting the adaptive chosen message attack and improving the sign generation efficiency, a signature scheme based on the… Expand
Is this relevant?
Highly Cited
2000
Highly Cited
2000
We describe and analyze a new digital signature scheme. The new scheme is quite efficient, does not require the signer to… Expand
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 the signer to… Expand
Is this relevant?