In their paper `From key predistribution to key redistribution', Cicho\'{n}, Goł\c{e}biewski and Kutyłowski propose a scheme for `redistributing' keys to a wireless sensor network using a broadcast channel after an initial key predistribution. We classify this as a BEKPS and analyse it in that context. We provide simpler proofs of some results from their paper, give a precise analysis of the resilience of their scheme, and discuss possible modifications. We then study two scenarios where BEKPSs may be particularly desirable and propose a suitable family of BEKPSs for each case. We demonstrate that they are practical and efficient to implement, and our analysis shows their effectiveness in achieving suitable trade-offs between the conflicting priorities in resource-constrained networks.
Category / Keywords: Original Publication (with minor differences): ACM Transactions on Sensor Networks (to appear) Date: received 28 May 2012, last revised 28 Mar 2014 Contact author: michelle louise kendall at gmail com Available format(s): PDF | BibTeX Citation Version: 20140328:113526 (All versions of this report) Short URL: ia.cr/2012/295