From Fixed-Length Messages to Arbitrary-Length Messages Practical RSA Signature Padding Schemes (original) (raw)

Abstract

We show how to construct a practical secure signature padding scheme for arbitrarily long messages from a secure signature padding scheme for fixed-length messages. This new construction is based on a one-way compression function respecting the division intractability assumption. By practical, we mean that our scheme can be instantia- ted using dedicated compression functions and without chaining. This scheme also allows precomputations on partially received messages. Finally, we give an instantiation of our scheme using SHA-1 and PKCS #1ver. 1.5.

This work was done while visiting Gemplus Montréal R&D Center.

Preview

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. N. Barić and B. Ptzmann. Collision-free accumulators and Fail-stop signature schemes without trees. In W. Fumy, editor, Advances in Cryptology-EUROCRYPT’ 97, Lecture Notes in Computer Science Vol. 1233, pages 480–494. Springer, 1997.
    Google Scholar
  2. M. Bellare and P. Rogaway. The Exact Security of Digital Signatures—How to Sign with RSA and Rabin. In U. Maurer, editor, Advances in Cryptology-EUROCRYPT’ 96, pages 399–416, 1996.
    Google Scholar
  3. S. Bakhtiari, R. Safavi-Naini, and J. Pieprzyk. Cryptographic Hash Functions: A Survey. Technical Report 95-09, University of Wollongong, 1995.
    Google Scholar
  4. J.-S. Coron, F. Koeune, and D. Naccache. From fixed-length to arbitrary-length RSA padding schemes. In Advances in Cryptology-ASIACRYPT’ 00. Springer, 2000. To appear.
    Google Scholar
  5. R. Gennaro, S. Halevi, and T. Rabin. Secure Hash-and-Sign Signatures without the Random Oracle. In J. Stern, editor, Advances in Cryptology-EUROCRYPT’ 99, Vol. 1592 of Lecture Notes in Computer Science, pages 123–139. Springer, 1999. http://www.research.ibm.com/security/ghr.ps.
    Google Scholar
  6. S. Goldwasser, S. Micali, and R. L. Rivest. A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks. SIAM Journal on Computing, 17(2):281–308, 1988. March 23, 1995 revision.
    Article MATH MathSciNet Google Scholar
  7. M. Luby. Pseudorandomness and Cryptographic Applications. Princeton University Press, 1996.
    Google Scholar
  8. J.-F. Misarsky. How (Not) to Design Signature Schemes.In Proceedings of PKC’ 98, Lecture Notes in Computer Science Vol. 1431. Springer, 1998.
    Google Scholar
  9. J. Pieprzyk and B. Sadeghiyan. Design of Hashing Algorithms. Lecture Notes in Computer Science Vol. 756. Springer, 1996.
    Google Scholar
  10. R. Rivest, A. Shamir, and L. Adleman. A Method for Obtaining Digital Signatures and Public Key Cryptosystems. CACM, 21, 1978.
    Google Scholar

Download references

Author information

Authors and Affiliations

  1. School of Computer Science, McGill University, Montréal, CANADA
    Geneviève Arboit1
  2. Gemplus Card International, Montréal R&D Center, CANADA
    Jean-Marc Robert

Authors

  1. Geneviève Arboit1
  2. Jean-Marc Robert

Editor information

Editors and Affiliations

  1. Gemplus Card International, 34 rue Guynemer, 92447, Issy les Moulineaux, France
    David Naccache

Rights and permissions

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Arboit1, G., Robert, JM. (2001). From Fixed-Length Messages to Arbitrary-Length Messages Practical RSA Signature Padding Schemes. In: Naccache, D. (eds) Topics in Cryptology — CT-RSA 2001. CT-RSA 2001. Lecture Notes in Computer Science, vol 2020. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45353-9\_4

Download citation

Keywords

Publish with us