We describe two new signature schemes with interesting algebraic properties.
The first is a ''transitive'' signature scheme used for signing edges of a graph, such that given Alice's signature for edge (u,v) and Alice's signature for edge (v,w), anyone else can compute Alice's signature on edge (u,w). This work is directed towards simplifying work with certificate chains in authorization infrastructures. (Joint work with Silvio Micali)
The second is a ''prefix aggregation'' scheme for signing binary strings such that given Alice's signature for the string ''x0'' and Alice's signature for the string ''x1'', anyone else can compute Alice's signature on the string ''x''. This work is directed towards simplifying work with Internet routing information. (Joint work with Tal Rabin and Suresh Chari)
You may download the slides of this talk from here.