From Key Predistribution to Key Redistribution

Cichoń, Jacek; Gołębiewski, Zbigniew; Kutyłowski, Mirosław

doi:10.1007/978-3-642-16988-5_9

Cited by 2 publications

(14 citation statements)

References 4 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The availability of such a broadcast channel has been discussed in [Cichoń et al 2010;Liu and Ning 2004]. We distinguish between the underlying keys which are predistributed to the nodes, and the temporal keys which are broadcast by the base station and which the nodes may use for communication until the next broadcast.…”

Section: Broadcast-enchanced Key Predistributionmentioning

confidence: 99%

“…This straightforward approach benefits from reducing the base station's future broadcast load. However, it has the potential to reduce the connectivity and resilience of the remaining network (we define these terms in Section 2), and repeated revocations may lead to rapid degeneration of the remaining network [Cichoń et al 2010]. In Section 4 we discuss a practical way to design a BEKPS for efficient revocation, where repeated revocations increase the broadcast load but do not lead to network degeneration.…”

Section: Broadcast-enchanced Key Predistributionmentioning

confidence: 99%

“…Section 3 provides some simpler versions of proofs from [Cichoń et al 2010] and discusses modifications of the Cichoń et al BEKPS based on defining a suitable intersection threshold.…”

Section: Broadcast-enchanced Key Predistributionmentioning

confidence: 99%

“…In [Cichoń et al 2010], Cichoń et al propose a 'key-redistribution' scheme for wireless sensor networks which makes use of a trusted base station and broadcast channel to distribute and update keys. This provides benefits over 'static' key predistribution schemes which are typically designed for networks which do not have access to a broadcast channel or a trusted base station after deployment.…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Broadcast-Enhanced Key Predistribution Schemes

Kendall

Martin

et al. 2014

ACM Trans. Sen. Netw.

View full text Add to dashboard Cite

We present a formalisation of a category of schemes which we call Broadcast-enhanced Key Predistribution Schemes (BEKPSs). These schemes are suitable for networks with access to a trusted base station and an authenticated broadcast channel. We demonstrate that the access to these extra resources allows for the creation of BEKPSs with advantages over key predistribution schemes such as flexibility and more efficient revocation. There are many possible ways to implement BEKPSs, and we propose a framework for describing and analysing them.In their paper 'From key predistribution to key redistribution', Cichoń, Go lȩbiewski and Kuty lowski 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.

show abstract

Section: Broadcast-enchanced Key Predistributionmentioning

confidence: 99%

Section: Broadcast-enchanced Key Predistributionmentioning

confidence: 99%

“…Section 3 provides some simpler versions of proofs from [Cichoń et al 2010] and discusses modifications of the Cichoń et al BEKPS based on defining a suitable intersection threshold.…”

Section: Broadcast-enchanced Key Predistributionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Broadcast-Enhanced Key Predistribution Schemes

Kendall

Martin

et al. 2014

ACM Trans. Sen. Netw.

View full text Add to dashboard Cite

show abstract

“…Indeed, if it is possible to determine the locations of the nodes after deployment, for example using an online base station or GPS, it may be feasible to construct the intersection graph and therefore estimate the expansion, once the WSN has been deployed. This is likely to be relevant if post-deployment key management protocols are available such as key refreshing [2] or key redistribution [10], for which it could be useful to know as much as possible about the vulnerability of the WSN. Some key management protocols are able to provide targeted improvements to specific weak areas of the network, and we explain below how best to identify such weaknesses.…”

Section: Using Expansion As a Metricmentioning

confidence: 99%

On the Role of Expander Graphs in Key Predistribution Schemes for Wireless Sensor Networks

Kendall

Martin

2012

Research in Cryptology

View full text Add to dashboard Cite

Abstract. Providing security for a wireless sensor network composed of small sensor nodes with limited battery power and memory can be a nontrivial task. A variety of key predistribution schemes have been proposed which allocate symmetric keys to the sensor nodes before deployment. In this paper we examine the role of expander graphs in key predistribution schemes for wireless sensor networks. Roughly speaking, a graph has good expansion if every 'small' subset of vertices has a 'large' neighbourhood, and intuitively, expansion is a desirable property for graphs of networks. It has been claimed that good expansion in the product graph is necessary for 'optimal' networks. We demonstrate flaws in this claim, argue instead that good expansion is desirable in the intersection graph, and discuss how this can be achieved. We then consider key predistribution schemes based on expander graph constructions and compare them to other schemes in the literature. Finally, we propose the use of expansion and other graph-theoretical techniques as metrics for assessing key predistribution schemes and their resulting wireless sensor networks.

show abstract

From Key Predistribution to Key Redistribution

Cited by 2 publications

References 4 publications

Broadcast-Enhanced Key Predistribution Schemes

Broadcast-Enhanced Key Predistribution Schemes

On the Role of Expander Graphs in Key Predistribution Schemes for Wireless Sensor Networks

Contact Info

Product

Resources

About