Allerton 2015 Paper Abstract


Paper ThA4.3

Zhao, Jun (CMU & ASU/Princeton)

On the Resilience to Node Capture Attacks of Secure Wireless Sensor Networks

Scheduled for presentation during the Regular Session "Sensor Networks I" (ThA4), Thursday, October 1, 2015, 09:10−09:30, Pine

53rd Annual Allerton Conference on Communication, Control, and Computing, Sept 29-Oct 2, 2015, Allerton Park and Retreat Center, Monticello, IL, USA

This information is tentative and subject to change. Compiled on December 5, 2021

Keywords Sensor Networks, Security and Trust, Sensor Networks in Communications


Despite much research on probabilistic key predistribution schemes for wireless sensor networks over the past decade, few formal analyses exist that define schemes’ resilience to node-capture attacks precisely and under realistic conditions. In this paper, we analyze the resilience of the q-composite key predistribution scheme, which mitigates the node capture vulnerability of the Eschenauer-Gligor scheme in the neighbor discovery phase. We also show that this scheme can be easily enhanced to achieve the same “perfect resilience” property as in the random pairwise key predistribution for attacks launched after neighbor discovery. Despite considerable attention to this scheme, much prior work explicitly or implicitly uses an incorrect computation for the probability of link compromise under node-capture attacks. Based on our rigorous results, we provide guidelines on the design of secure sensor networks for resilience against node capture.



All Content © PaperCept, Inc..

This site is protected by copyright and trademark laws under US and International law.
All rights reserved. © 2002-2021 PaperCept, Inc.
Page generated 2021-12-05  10:20:13 PST  Terms of use