Fischlin M, Lehmann A, Schröder D (2012)
Publication Status: Published
Publication Type: Authored book, Volume of book series
Publication year: 2012
Series: Security and Cryptography for Networks - SCN 2012
Pages Range: 113-130
Event location: Amalfi
ISBN: 9783642329272
DOI: 10.1007/978-3-642-32928-9_7
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. © 2012 Springer-Verlag.
APA:
Fischlin, M., Lehmann, A., & Schröder, D. (2012). History-free sequential aggregate signatures.
MLA:
Fischlin, Marc, Anja Lehmann, and Dominique Schröder. History-free sequential aggregate signatures. 2012.
BibTeX: Download