History-Free Sequential Aggregate Signatures
Aggregation schemes allow to combine several cryptographic values like message authentication codes or signatures into a shorter value such that, despite compression, some notion of unforgeability is preserved. Recently, Eikemeier et al. (SCN 2010) considered the notion of history-free sequential aggregation for message authentication codes, where the sequentially-executed aggregation algorithm does not need to receive the previous messages in the sequence as input. Here we discuss the idea for signatures where the new aggregate does not rely on the previous messages and public keys either, thus inhibiting the costly verifications in each aggregation step as in previous schemes by Lysyanskaya et al. (Eurocrypt 2004) and Neven (Eurocrypt 2008). Analogously to MACs we argue about new security definitions for such schemes and compare them to previous notions for history-dependent schemes. We finally give a construction based on the BLS signature scheme which satisfies our notion.
Unable to display preview. Download preview PDF.
- 1.Ahn, J.H., Green, M., Hohenberger, S.: Synchronized aggregate signatures: New definitions, constructions and applications. In: Annual Conference on Computer and Communications Security (CCS), pp. 473–484. ACM Press (2010)Google Scholar
- 5.Boldyreva, A., Gentry, C., O’Neill, A., Yum, D.H.: New multiparty signature schemes for network routing applications. ACM Trans. Inf. Syst. Secur. 12(1) (2008)Google Scholar
- 8.Brogle, K., Goldberg, S., Reyzin, L.: Sequential aggregate signatures with lazy verification. Cryptology ePrint Archive: Report 2011/222 (2011), http://eprint.iacr.org/2011/222l
- 12.Lepinski, M.: BGPSec protocol specification. IETF Internet-Draft (2011)Google Scholar
- 15.Micali, S., Ohta, K., Reyzin, L.: Accountable-subgroup multisignatures: extended abstract. In: Annual Conference on Computer and Communications Security (CCS), pp. 245–254. ACM Press (2001)Google Scholar