In cryptography, the RSA problem summarizes the task of performing an RSA private-key operation given only the public key. The RSA algorithm raises a… (More)

Semantic Scholar uses AI to extract papers important to this topic.

2008

2008

- Divesh Aggarwal, Ueli Maurer
- IEEE Transactions on Information Theory
- 2008

Let <inline-formula> <tex-math notation="LaTeX">$N$ </tex-math></inline-formula> be a random variable distributed according to… (More)

Is this relevant?

2007

2007

- Javier Herranz
- Theor. Comput. Sci.
- 2007

Shamir proposed in 1984 the first identity-based signature scheme, whose security relies on the RSA problem. A similar scheme was… (More)

Is this relevant?

2006

2006

- Gregor Leander, Andy Rupp
- ASIACRYPT
- 2006

To prove or disprove the computational equivalence of solving the RSA problem and factoring integers is a longstanding open… (More)

Is this relevant?

2006

2006

- Daniel R. L. Brown
- IACR Cryptology ePrint Archive
- 2006

Firstly, we demonstrate a pathological hash function choice that makes RSA-OAEP insecure. This shows that at least some security… (More)

Is this relevant?

2005

2005

- Damien Vergnaud
- WCC
- 2005

A secret handshake mechanism allows two entities, members of a same group, to authenticate each other secretly. This primitive… (More)

Is this relevant?

2005

2005

- Daniel R. L. Brown
- Journal of Cryptology
- 2005

If factoring is hard, this paper shows that straight line programs cannot efficiently solve the low public exponent RSA problem… (More)

Is this relevant?

1999

1999

- David Pointcheval
- EUROCRYPT
- 1999

Since the Diffie-Hellman paper, asymmetric encryption has been a very important topic, and furthermore ever well studied. However… (More)

Is this relevant?

Highly Cited

1999

Highly Cited

1999

- Victor Shoup
- EUROCRYPT
- 1999

We present an RSA threshold signature scheme. The scheme enjoys the following properties: 1. it is unforgeable and robust in the… (More)

Is this relevant?

Highly Cited

1998

Highly Cited

1998

- Jan Camenisch, Markus Michels, Jan Camenischy
- 1998

The concept of group signatures allows a group member to sign messages anonymously on behalf of the group. However, in the case… (More)

Is this relevant?

Highly Cited

1992

Highly Cited

1992

- Sailesh K. Rao, P. Sadayappan, Frank K. Hwang, Peter W. Shor
- Algorithmica
- 1992

The Rectilinear Steiner Arborescence (RSA) problem is “Given a setN ofn nodes lying in the first quadrant of E2, find the… (More)

Is this relevant?