Abstract
Hello everyone, and thank you all for coming, even though the dinner is already passed. Today I’m going to be talking about a little bit narrower a topic than the previous talks were. As my latest work focuses on automated evaluation of key management schemes for wireless sensor networks, and this is just a part of that. We have built a framework on top of an existing simulator, and one of the main metrics, or parts, that you want to characterise, to evaluate in a key management scheme is the network resiliency of such a scheme. And usually it’s always considered one kind of attacker, the random attacker strategy of capturing nodes. We thought that, well if I were the attacker I would want to go the most efficient way, and is there some way like that. First, I will give a brief introduction to several things, and then we’ll see the results of the evaluations.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Jurnečka, F. (2014). On Node Capturing Attacker Strategies (Transcript of Discussion). In: Christianson, B., Malcolm, J., Matyáš, V., Švenda, P., Stajano, F., Anderson, J. (eds) Security Protocols XXII. Security Protocols 2014. Lecture Notes in Computer Science(), vol 8809. Springer, Cham. https://doi.org/10.1007/978-3-319-12400-1_30
Download citation
DOI: https://doi.org/10.1007/978-3-319-12400-1_30
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-12399-8
Online ISBN: 978-3-319-12400-1
eBook Packages: Computer ScienceComputer Science (R0)