Team for Research in
Ubiquitous Secure Technology

Citation
Nathaniel Karst, Stephen Wicker. "Secure Re-keying and Collusion Prevention Using Block Designs". IEEE Transactions on Networking, 2010.

Abstract
We expand and generalize the work of Eltoweissy, Heydari and Morales on secure re-keying in group communications systems. Eltoweissy et al. introduced (n; k;m) exclusion basis systems (EBSs) in which k keys are administered to each of n users such that the entire network can be re-keyed with m messages after a single user leaves the system. We generalize their work by proving that an arbitrary simple t-(v; b; r; k; ) block design generates an EBS. We go on to show that the number re-key messages can be reduced if we restrict our attention to square 2-(v; k; ) designs. Furthermore, we show that square 2- (v; k; ) designs generate EBSs in which fewer than dk=e users cannot successfully collude to illicitly decipher transmissions

Electronic downloads

• secureRekey_short-1.pdf · application/pdf · 191 kbytes

• HTML

  Nathaniel Karst, Stephen Wicker. <a
  href="http://www.truststc.org/pubs/694.html"
  >Secure Re-keying and Collusion Prevention Using Block
  Designs</a>, <i>IEEE Transactions on
  Networking</i>,  2010.

• Plain text

  Nathaniel Karst, Stephen Wicker. "Secure Re-keying and
  Collusion Prevention Using Block Designs".
  <i>IEEE Transactions on Networking</i>,  2010.

• BibTeX

  @article{KarstWicker10_SecureRekeyingCollusionPreventionUsingBlockDesigns,
      author = {Nathaniel Karst and Stephen Wicker},
      title = {Secure Re-keying and Collusion Prevention Using
                Block Designs},
      journal = {IEEE Transactions on Networking},
      year = {2010},
      abstract = {We expand and generalize the work of Eltoweissy,
                Heydari and Morales on secure re-keying in group
                communications systems. Eltoweissy et al.
                introduced (n; k;m) exclusion basis systems (EBSs)
                in which k keys are administered to each of n
                users such that the entire network can be re-keyed
                with m messages after a single user leaves the
                system. We generalize their work by proving that
                an arbitrary simple t-(v; b; r; k; ) block design
                generates an EBS. We go on to show that the number
                re-key messages can be reduced if we restrict our
                attention to square 2-(v; k; ) designs.
                Furthermore, we show that square 2- (v; k; )
                designs generate EBSs in which fewer than dk=e
                users cannot successfully collude to illicitly
                decipher transmissions},
      URL = {http://www.truststc.org/pubs/694.html}
  }
  

Posted by Jessica Gamble on 2 Apr 2010.
For additional information, see the Publications FAQ or contact webmaster at www truststc org.