Abstract
Usage of various key (pre-)distribution schemes (KDSs) in networks with an active attacker results in a partially compromised network where some fraction of keys used to protect link communication is known to the attacker. The secrecy amplification protocols were proposed to secure again some previously compromised communication links by using non-compromised paths to deliver new secure keys. Design of suitable secrecy amplification protocols remains a challenge in scenarios where a trade-off between necessary resources (e.g., energy necessary for transmission of message) and improvement in the number of secure links must be balanced. We inspect classes of secrecy amplification protocols known as node-oriented and group-oriented protocols proposed for use in wireless sensor networks (WSN).
We combine analysis of given protocol participant placement via a simulator and manual post-processing to provide a simpler, practically usable hybrid protocol with less steps and lower communication overhead, yet still better in terms of re-secured links than previously proposed protocols.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
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)
Brameier, M.F., Banzhaf, W.: Linear Genetic Programming (Genetic and Evolutionary Computation). Springer-Verlag New York, Inc., Secaucus (2006)
Chan, H., Perrig, A., Song, D.: Random key predistribution schemes for sensor networks. In: IEEE Symposium on Security and Privacy, pp. 197–213 (2003)
Chan, H., Perrig, A., Song, D.: Wireless Sensor Networks. Kluwer Academic Publishers, Norwell (2004)
Cvrček, D., Švenda, P.: Smart dust security-key infection revisited. Electronic Notes in Theoretical Computer Science 157, 11–25 (2006)
Di Pietro, R., Mancini, L.V., Mei, A.: Random key-assignment for secure wireless sensor networks. In: 1st ACM Workshop on Security of Ad Hoc and Sensor Networks, pp. 62–71. ACM (2003)
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)
Liu, D., Ning, P.: Establishing pairwise keys in distributed sensor networks. In: 10th ACM Conference on Computer and Communications Security, pp. 52–61. ACM Press (2003)
Smolka, T., Švenda, P., Sekanina, L., Matyáš, V.: Evolutionary design of message efficient secrecy amplification protocols. In: 12th European Conference on Genetic Programming, pp. 194–205 (2012)
Švenda, P., Matyáš, V.: Key distribution and secrecy amplification in wireless sensor networks, Technical report FIMU-RS-2007-05. Masaryk university, Czech Republic (2007)
Š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)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Ošťádal, R., Švenda, P., Matyáš, V. (2014). A New Approach to Secrecy Amplification in Partially Compromised Networks (Invited Paper). In: Chakraborty, R.S., Matyas, V., Schaumont, P. (eds) Security, Privacy, and Applied Cryptography Engineering. SPACE 2014. Lecture Notes in Computer Science, vol 8804. Springer, Cham. https://doi.org/10.1007/978-3-319-12060-7_7
Download citation
DOI: https://doi.org/10.1007/978-3-319-12060-7_7
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-12059-1
Online ISBN: 978-3-319-12060-7
eBook Packages: Computer ScienceComputer Science (R0)