A Survey of Two Signature Aggregation Techniques (survey)

By Dan Boneh, Craig Gentry, Ben Lynn, and Hovav Shacham.

RSA CryptoBytes, vol. 6, no. 2 (2003), pages 1–9.


We survey two recent signature constructions that support 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 original messages (i.e., for i=1,…,n user i signed message number i). We survey two constructions. The first is based on the short signature scheme of Boneh, Lynn, and Shacham and supports general aggregation. The second, based on a multisignature scheme of Micali, Ohta, and Reyzin, is built from any trapdoor permutation but only supports sequential aggregation. Aggregate signatures are useful for reducing the size of certificate chains (by aggregating all signatures in the chain) and for reducing message size in secure routing protocols such as SBGP.



@Article{BGLS03b, author = {Dan Boneh and Craig Gentry and Ben Lynn and Hovav Shacham}, title = {A Survey of Two Signature Aggregation Techniques}, journal = {{RSA} Cryptobytes}, year = 2003, volume = 6, number = 2, pages = {1-9}, month = {Summer} }

Navigation: Hovav Shacham // Publications // [BGLS03b]