Abstract
In this work, we propose a completely different design of key distribution protocols for ad-hoc networks of nodes with restricted resources, wireless sensor networks (WSNs). Earlier research on so-called secrecy amplification (SA) for WSNs went with the discrete “take it or leave it” design – either the newly transferred key components got to their destination securely, or the attacker learned their values. And as the SA measures are probabilistic and preventive in nature, no-one but the attacker knew what the attacker learned (and when Mallory learned a key component, she obviously did not push for the fail-deadly trigger). We propose to combine vanilla secrecy amplification with key extraction from the radio channel, coming up with a novel method to produce and deliver key updates to individual link keys.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsNotes
- 1.
The individual bit string is denoted as \(En\_AB\) for nodes A and B.
- 2.
The push version requires the link from the initiating node to the intermediate node to be secure.
References
Anderson, R., Chan, H., Perrig, A.: Key infection: smart trust for smart dust. In: 12th IEEE International Conference on Network Protocols, pp. 206–215. IEEE (2004)
Cvrcek, D., Svenda, P.: Smart dust security key infection revisited. Electron. Notes Theor. Comput. Sci. 157(3), 11–25 (2006). Proceedings of the First International Workshop on Security and Trust Management (STM 2005)
Eschenauer, L., Gligor, V.D.: A key-management scheme for distributed sensor networks. In: 9th ACM Conference on Computer and Communications Security, Washington, DC, USA, pp. 41–47. ACM (2002)
Jana, S., Premnath, S.N., Clark, M., Kasera, S.K., Patwari, N., Krishnamurthy, S.V.: On the effectiveness of secret key extraction from wireless signal strength in real environments. In: Proceedings of the 15th Annual International Conference on Mobile Computing and Networking, MobiCom 2009, pp. 321–332. ACM, New York (2009)
Ošťádal, R., Švenda, P., Matyáš, V.: Attackers in wireless sensor networks will be neither random nor jumping – secrecy amplification case. In: Foresti, S., Persiano, G. (eds.) CANS 2016. LNCS, vol. 10052, pp. 552–561. Springer, Cham (2016). https://doi.org/10.1007/978-3-319-48965-0_34
Ošťádal, R., Švenda, P., Matyáš, V.: On secrecy amplification protocols. In: Akram, R.N., Jajodia, S. (eds.) WISTP 2015. LNCS, vol. 9311, pp. 3–19. Springer, Cham (2015). https://doi.org/10.1007/978-3-319-24018-3_1
Švenda, P., Sekanina, L., Matyáš, V.: Evolutionary design of secrecy amplification protocols for wireless sensor networks. In: Second ACM Conference on Wireless Network Security, pp. 225–236 (2009)
Acknowledgements
Czech Science Foundation project GBP202/12/G061 partly supported this work.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer Nature Switzerland AG
About this paper
Cite this paper
Nemec, L., Ostadal, R., Matyas, V., Svenda, P. (2018). Entropy Crowdsourcing – Protocols for Link Key Updates in Wireless Sensor Networks. In: Matyáš, V., Švenda, P., Stajano, F., Christianson, B., Anderson, J. (eds) Security Protocols XXVI. Security Protocols 2018. Lecture Notes in Computer Science(), vol 11286. Springer, Cham. https://doi.org/10.1007/978-3-030-03251-7_9
Download citation
DOI: https://doi.org/10.1007/978-3-030-03251-7_9
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-03250-0
Online ISBN: 978-3-030-03251-7
eBook Packages: Computer ScienceComputer Science (R0)