Fully secure pairwise and triple key distribution in wireless sensor networks using combinatorial designs

@article{Ruj2011FullySP,
  title={Fully secure pairwise and triple key distribution in wireless sensor networks using combinatorial designs},
  author={Sushmita Ruj and Amiya Nayak and Ivan Stojmenovic},
  journal={2011 Proceedings IEEE INFOCOM},
  year={2011},
  pages={326-330}
}
We address pairwise and (for the first time) triple key establishment problems in wireless sensor networks (WSN). We use combinatorial designs to establish pairwise keys between nodes in a WSN. A BIBD(v; b; r; k; λ) (or t - (v; b; r; k; λ)) design can be mapped to a sensor network, where v represents the size of the key pool, b represents the maximum number of nodes that the network can support, k represents the size of the key chain. Any pair (or t-subset) of keys occurs together uniquely in… CONTINUE READING
Highly Cited
This paper has 40 citations. REVIEW CITATIONS
27 Citations
21 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 27 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 21 references

Similar Papers

Loading similar papers…