Sequential Aggregate Signatures Made Shorter

  • Kwangsu Lee
  • Dong Hoon Lee
  • Moti Yung
Conference paper

DOI: 10.1007/978-3-642-38980-1_13

Volume 7954 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
Lee K., Lee D.H., Yung M. (2013) Sequential Aggregate Signatures Made Shorter. In: Jacobson M., Locasto M., Mohassel P., Safavi-Naini R. (eds) Applied Cryptography and Network Security. ACNS 2013. Lecture Notes in Computer Science, vol 7954. Springer, Berlin, Heidelberg

Abstract

Sequential aggregate signature (SAS) is a special type of public-key signature that allows a signer to add his signature into a previous aggregate signature in sequential order. In this case, since many public keys are used and many signatures are employed and compressed, it is important to reduce the sizes of signatures and public keys. Recently, Lee et al. proposed an efficient SAS scheme with short public keys and proved its security without random oracles under static assumptions. In this paper, we propose an improved SAS scheme that has a shorter signature size compared with that of Lee et al.’s SAS scheme. Our SAS scheme is also secure without random oracles under static assumptions. To achieve the improvement, we devise a new public-key signature scheme that supports multi-users and public re-randomization. Compared with the SAS scheme of Lee et al., our SAS scheme employs new techniques which allow us to reduce the size of signatures by increasing the size of the public keys (obviously, since signature compression is at the heart of aggregate signature this is a further step in understanding the aggregation capability of such schemes).

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • Kwangsu Lee
    • 1
  • Dong Hoon Lee
    • 1
  • Moti Yung
    • 2
    • 3
  1. 1.Korea UniversityKorea
  2. 2.Columbia UniversityUSA
  3. 3.Google Inc.USA