Sequential Aggregate Signatures and Multisignatures Without Random Oracles

  • Steve Lu
  • Rafail Ostrovsky
  • Amit Sahai
  • Hovav Shacham
  • Brent Waters
Conference paper

DOI: 10.1007/11761679_28

Part of the Lecture Notes in Computer Science book series (LNCS, volume 4004)
Cite this paper as:
Lu S., Ostrovsky R., Sahai A., Shacham H., Waters B. (2006) Sequential Aggregate Signatures and Multisignatures Without Random Oracles. In: Vaudenay S. (eds) Advances in Cryptology - EUROCRYPT 2006. EUROCRYPT 2006. Lecture Notes in Computer Science, vol 4004. Springer, Berlin, Heidelberg

Abstract

We present the first aggregate signature, the first multisignature, and the first verifiably encrypted signature provably secure without random oracles. Our constructions derive from a novel application of a recent signature scheme due to Waters. Signatures in our aggregate signature scheme are sequentially constructed, but knowledge of the order in which messages were signed is not necessary for verification. The aggregate signatures obtained are shorter than Lysyanskaya et al. sequential aggregates and can be verified more efficiently than Boneh et al. aggregates. We also consider applications to secure routing and proxy signatures.

Download to read the full conference paper text

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Steve Lu
    • 1
  • Rafail Ostrovsky
    • 1
  • Amit Sahai
    • 1
  • Hovav Shacham
    • 2
  • Brent Waters
    • 3
  1. 1.UCLA 
  2. 2.Weizmann Institute of Science 
  3. 3.SRI International 

Personalised recommendations