Evolutionary design of secrecy amplification protocols for wireless sensor networks

Švenda, Petr; Sekanina, Lukáš; Matyáš, Václav

doi:10.1145/1514274.1514306

Cited by 17 publications

(21 citation statements)

References 20 publications

(30 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Variants of the Push and Multi-hop Push protocols called Pull and Multi-hop Pull protocols were presented by Cvrcek et al in [12]. The best-performing node-oriented protocol (NO Best) was presented by Svenda et al in [3] and more information about that protocol is provided in the Appendix A.1.…”

Section: Secrecy Amplification Principles and Related Workmentioning

confidence: 99%

“…Although this could appear to be a hopeless attempt without the knowledge of the compromised links and without a broadly coordinated cooperation, the results show that the nodes, as a crowd, can achieve an excellent performance. A strong majority of secure links (>90%) can be achieved using secrecy amplification protocols, even when 50% of all network links are initially compromised [3].…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Crowdsourced Security Reconstitution for Wireless Sensor Networks: Secrecy Amplification

Ostadal

Matyáš

Švenda

et al. 2019

Sensors

View full text Add to dashboard Cite

Research in the area of security for Wireless Sensor Networks over the past two decades has yielded many interesting findings. We focus on the topic of (re-)securing link keys between sensor nodes through so-called secrecy amplification (SA) protocols. Crowdsourcing is at the very heart of these SA protocols. Not only do SA protocols work wonders even for low-level constrained nodes with no tamper resistance, they exhibit astonishing performance in networks under significant attacker control. Our work shows that even when 50% of all network links are compromised, SA protocols can re-secure over 90% of the link keys through an intriguingly simple crowdsourcing mechanism. These protocols allow us to re-take control without any broadly coordinated cooperation, without knowledge of the compromised links, with only very limited knowledge of each particular network node and independently of decisions made by other nodes. Our article first outlines the principles of and presents existing approaches to SA, introducing most of the important related concepts, then presents novel conclusive results for a realistic attacker model parametrised by attacker behaviour and capabilities. We undertook this work using two very different simulators, and we present here the results of analyses and detailed comparisons that have not previously been available. Finally, we report the first real, non-simulated network test results for the most attractive SA protocol, our implementations of which are available as open-source code for two platforms: Arduino and TinyOS. This work demonstrates the practical usability (and the attractive performance) of SA, serving as a ripe technology enabler for (among others) networks with many potentially compromised low-level devices.

show abstract

Section: Secrecy Amplification Principles and Related Workmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Crowdsourced Security Reconstitution for Wireless Sensor Networks: Secrecy Amplification

Ostadal

Matyáš

Švenda

et al. 2019

Sensors

View full text Add to dashboard Cite

show abstract

“…It uses already secured links to establish link keys between two neighboring nodes that could not establish a link key directly as they had no shared key or their keys were compromised [3].…”

Section: Background and Related Workmentioning

confidence: 99%

Two Improvements of Random Key Predistribution for Wireless Sensor Networks

Kůr

Matyáš

Švenda

2013

Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering

Self Cite

View full text Add to dashboard Cite

Abstract. Key distribution is of a critical importance to security of wireless sensor networks (WSNs). Random key predistribution is an acknowledged approach to the key distribution problem. In this paper, we propose and analyze two novel improvements that enhance security provided by the random key predistribution schemes. The first improvement exploits limited length collisions in secure hash functions to increase the probability of two nodes sharing a key. The second improvement introduces hash chains into the key pool construction to directly increase the resilience against a node capture attack. Both improvements can be further combined to bring the best performance. We evaluate the improvements both analytically and computationally on a network simulator. The concepts used are not limited to the random key predistribution.

show abstract

“…Besides above research, some security protocols are designed for the special service application, such as evolutionary design of secrecy amplification protocols [4], self-healing control flow protection [5], practical characterization of 802.11 access points inparis [6] and so on.…”

Section: Introductionmentioning

confidence: 99%

Research on Security Portocol of Scheduled Services on Cloud Computing

Li¹,

Chen²,

Lu³

et al. 2016

Proceedings of the 1st International Conference on Information Technologies in Education and Learning

View full text Add to dashboard Cite

With the large growth of wireless sensor network, the current security architecture couldn't solve the problems. This paper provides a security protocol of scheduled service based on cloud computing. The system is consisted of three groups that are domain server domain register server domain and functional server domain. The system encrypts the server address by disconnected message. Then two algorithms are proposed for dynamic key change when system should recalculate the login key. At last, the performance loss is measured for above algorithms. Meanwhile, the improvement of system is discussed by experiment results.

show abstract

Evolutionary design of secrecy amplification protocols for wireless sensor networks

Cited by 17 publications

References 20 publications

Crowdsourced Security Reconstitution for Wireless Sensor Networks: Secrecy Amplification

Crowdsourced Security Reconstitution for Wireless Sensor Networks: Secrecy Amplification

Two Improvements of Random Key Predistribution for Wireless Sensor Networks

Research on Security Portocol of Scheduled Services on Cloud Computing

Contact Info

Product

Resources

About