Unrestricted aggregate signatures

  • Authors:
  • Mihir Bellare;Chanathip Namprempre;Gregory Neven

  • Affiliations:
  • Department of Computer Science & Engineering, University of California San Diego, La Jolla, CA;Electrical Engineering Department, Thammasat University, Patumtani, Thailand;Department of Electrical Engineering, Katholieke Universiteit Leuven, Heverlee-Leuven, Belgium

  • Venue:
  • ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

Secure use of the BGLS [1] aggregate signature schemes is restricted to the aggregation of distinct messages (for the basic scheme) or per-signer distinct messages (for the enhanced, prepend-public-key version of the scheme). We argue that these restrictions preclude interesting applications, make usage of the schemes error-prone and are generally undesirable in practice. Via a new analysis and proof, we show how the restrictions can be lifted, yielding the first truly unrestricted aggregate signature scheme. Via another new analysis and proof, we show that the distinct signer restriction on the sequential aggregate signature schemes of [2] can also be dropped, yielding an unrestricted sequential aggregate signature scheme.