A survey of two signature aggregation techniques

We survey two recent signature constructions that sup-port signature aggregation: Given n signatures on n distinct messages from n distinct users, it is possible to aggregate all these signatures into a single signature. This single signature (and all n original messages) will convince any verifier that the n users signed the n orig-inal messages (i.e., for i 1 n user i signed mes-sage number i). We survey two constructions. The first is based on the short signature scheme of Boneh, Lynn, and Shacham and supports general aggrega-tion. The second, based on a multisignature scheme of Micali, Ohta, and Reyzin, is built from any trap-door permutation but only supports sequential aggre-gation. Aggregate signatures are useful for reducing the size of certificate chains (by aggregating all sig-natures in the chain) and for reducing message size in secure routing protocols such as SBGP.