@techreport{balenson-groupkeymgmt-oft-00,
    number =    {draft-balenson-groupkeymgmt-oft-00},
    type =      {Internet-Draft},
    institution =   {Internet Engineering Task Force},
    publisher = {Internet Engineering Task Force},
    note =      {Work in Progress},
    url =       {https://datatracker.ietf.org/doc/draft-balenson-groupkeymgmt-oft/00/},
    author =    {David M. Balenson and David McGrew and Dr. Alan T. Sherman},
    title =     {{Key Management for Large Dynamic Groups:  One-Way Function Trees and Amortized Initialization}},
    pagetotal = 25,
    year =      1999,
    month =     mar,
    day =       3,
    abstract =  {We present a scalable method for establishing group session keys for secure large, dynamic groups such as multicast sessions. Our method is based on a novel application of One-Way Function Trees (OFTs). The number of keys stored by group members, the number of keys broadcast to the group when new members are added or evicted, and the computational efforts of group members, are logarithmic in the number of group members. The method provides perfect forward and backward security: evicted members cannot read future messages, even with collusion by arbitrarily many evicted members, and newly admitted group members cannot read previous messages.},
}