Short and Stateless Signatures from the RSA Assumption

@article{Hohenberger2009ShortAS,
  title={Short and Stateless Signatures from the RSA Assumption},
  author={Susan Hohenberger and Brent Waters},
  journal={IACR Cryptology ePrint Archive},
  year={2009},
  volume={2009},
  pages={283}
}
We present the first signature scheme which is “short”, stateless and secure under the RSA assumption in the standard model. Prior short, standard model signatures in the RSA setting required either a strong complexity assumption such as Strong RSA or (recently) that the signer maintain state. A signature in our scheme is comprised of one element in ZN and one integer. The public key is also short, requiring only the modulus N , one element of ZN , one integer, one PRF seed and some short… CONTINUE READING
Highly Influential
This paper has highly influenced 21 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
81 Citations
33 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 81 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 33 references

Probabilistic algorithm for testing primality

  • Michael O. Rabin
  • Journal of Number Theory,
  • 1980
Highly Influential
6 Excerpts

Similar Papers

Loading similar papers…