Multiple-Time Signature Schemes against Adaptive Chosen Message Attacks

  • Josef Pieprzyk
  • Huaxiong Wang
  • Chaoping Xing
Conference paper

DOI: 10.1007/978-3-540-24654-1_7

Part of the Lecture Notes in Computer Science book series (LNCS, volume 3006)
Cite this paper as:
Pieprzyk J., Wang H., Xing C. (2004) Multiple-Time Signature Schemes against Adaptive Chosen Message Attacks. In: Matsui M., Zuccherato R.J. (eds) Selected Areas in Cryptography. SAC 2003. Lecture Notes in Computer Science, vol 3006. Springer, Berlin, Heidelberg


Multiple-time signatures are digital signature schemes where the signer is able to sign a predetermined number of messages. They are interesting cryptographic primitives because they allow to solve many important cryptographic problems, and at the same time offer substantial efficiency advantage over ordinary digital signature schemes like RSA. Multiple-time signature schemes have found numerous applications, in ordinary, on-line/off-line, forward-secure signatures, and multicast/stream authentication. We propose a multiple-time signature scheme with very efficient signing and verifying. Our construction is based on a combination of one-way functions and cover-free families, and it is secure against the adaptive chosen-message attack.

Download to read the full conference paper text

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Josef Pieprzyk
    • 1
  • Huaxiong Wang
    • 2
  • Chaoping Xing
    • 3
  1. 1.Centre for Advanced Computing – Algorithms and Cryptography Department of ComputingMacquarie UniversityAustralia
  2. 2.Department of MathematicsNational University of SingaporeSingapore
  3. 3.Department of MathematicsUniversity of Science and Technology of ChinaChina

Personalised recommendations