@Unpublished{CRR02,
  author = 	 { Suresh Chari and Tal Rabin and Ronald L. Rivest },
  title = 	 { An Efficient Scheme for Route Aggregation },
  date =         { 2002-02-01 },                  
  OPTmonth = 	 { February 1, },
  OPTyear = 	 { 2002 },
  htmlnote = 	 { A related talk 
                   <a href="#Riv00">Riv00</a> was given in 2000. },
  abstract =     {
        The strongest security guarantees for routing protocols can be
        obtained by the use of signatures on information in routing messages.
        The goal of digital signature mechanisms is to be unforgeable, i.e.
        signatures of new messages can be computed from known signatures of
        other messages.  This raises an interesting problem for hierarchical
        routing protocols such as OSPF where specially designed routers have
        to aggregate information from one level of the hierarchy into the next.
        If digital signatures are used, these routers need to compute the
        signature of aggregated information, possessin only the signatures on
        component information. \par
           In this paper, we address this problem by describing a new and
        efficient signature scheme to sign the nodes of a full binary tree
        with carefully designed algebraic properties: Given the signatures of
        the children of a node, it is easy to compute the signature of the node.
        While this scheme is not unforgeable in the traditional sense, we guarantee
        that no adversary will be able to forge the signature of a node without
        seeing or computing the signatures of all of its children.  We use this
        scheme to derive efficient solutions to the problem of signing aggregated
        routes in hierarchical routing protocols.                          
                 },                   
}