Open AccessBook Chapter10.1007/978-3-319-24018-3_1

On Secrecy Amplification Protocols

- 24 Aug 2015

- pp 3-19

TL;DR: Most important secrecy amplification protocols that are suitable for ad-hoc networks of devices with limited resources, providing additional resistance against various attacks on used cryptographic keys without necessity for asymmetric cryptography are reviewed.

Abstract: We review most important secrecy amplification protocols that are suitable for ad-hoc networks of devices with limited resources, providing additional resistance against various attacks on used cryptographic keys without necessity for asymmetric cryptography We discuss and evaluate different designs as well as approaches to create new protocols A special focus is given to suitability of these protocols with respect to different underlying key distribution schemes and also to open issues

AI Agents for this Paper

Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps

Most frequently asked questions

1. What are the contributions in "On secrecy amplification protocols" ?

The authors review most important secrecy amplification protocols that are suitable for ad-hoc networks of devices with limited resources, providing additional resistance against various attacks on used cryptographic keys without necessity for asymmetric cryptography.. The authors discuss and evaluate different designs as well as approaches to create new protocols.

Fig. 1: Left: An example of instructions of a several node-oriented SA protocols. The Push, Pull and multi-hop version of Pull are included. A distance between nodes NC and NP is 0.5 of the maximal transmission range. Right: An example of instructions of a basic hybrid SA protocol. The Push, Pull and multi-hop version of Pull protocol are included. Selected node-relative identification (distance from NC and NP ) of involved parties are displayed as the geographic most probable areas, where such nodes will be positioned. A probabilistic layout shown is for the case where the distance between nodes NC and NP is 0.5 of the maximal transmission range. Notation used is according to the Table 1.

Table 2: Basic characteristics of SA protocols. M/A means manual/automatic design approach respectively. Synchronization 1/3 means easy/difficult.

Fig. 4: Increase in the number of secured links divided by the number of exchanged messages during the protocol execution (random compromise pattern, 20.3 legal neighbours on average). Node-oriented protocols send significantly more messages with rising network density. This stands especially for 4-party node-oriented protocols, which are the least effective. The best tradeoff shows group-oriented and hybrid protocols, while HD PULLPUSH14 RP also outperforms the rest of protocols with regards to success rate.

Fig. 3: Increase in the number of secured links after SA protocols in the random compromise pattern on network with 20.3 legal neighbours on average. With increasing number of neighbouring nodes the general effectiveness of protocol grows. As can be seen, a strong majority of secure links (> 90%) can be obtained even when the initial network had 80% of compromised links. The best performing protocol is HD PULLPUSH14 RP and it sends only little bit more messages than GO EA12 RP. As can be observed, the 4-party node-oriented protocols show very good results on networks with high density. The least successful protocol is GO EA09 because it was optimized for key infection pattern.

Fig. 2: Total number of messages per single node required by a particular SA protocol. Even when group-oriented protocols utilise more messages per single execution and hybrid protocols utilise several protocol repetitions, the total number of messages is smaller than in case of node-oriented protocols for networks with higher density. Number of messages grows polynomially with the number of neighbouring nodes for node-oriented protocols compared to linear increase in case of group-oriented and hybrid protocols. Note the logarithmic scale of the y-axis.

Table 1: Notation used for secrecy amplification (SA) protocols.

Citations

•Journal Article•10.3390/S19225041

Crowdsourced Security Reconstitution for Wireless Sensor Networks: Secrecy Amplification.

Radim Ostadal, +3 more

- 19 Nov 2019

- Sensors

TL;DR: This 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, and demonstrates the practical usability and attractive performance of SA.

...read moreread less

•Book Chapter•10.1007/978-3-319-24018-3_1

On Secrecy Amplification Protocols

Radim Ošźádal, +2 more

- 24 Aug 2015

...read moreread less

Book Chapter•10.1007/978-3-319-62033-6_25

Reconsidering Attacker Models in Ad-Hoc Networks

Radim Ošťádal, +2 more

- 07 Apr 2016

TL;DR: Extension of the current attacker models is necessary, including the differentiation based on types of attacker’s manipulation with a node, monitoring capabilities and movement strategies, and suitable secrecy amplification protocols are proposed that reflect the new attacker models in different examined scenarios.

...read moreread less

Proceedings Article•10.1109/DCOSS.2018.00028

Adaptive Secrecy Amplification with Radio Channel Key Extraction

Lukas Nemec, +3 more

- 18 Jun 2018

TL;DR: This paper addresses the issue how cryptographic link keys between communicating sensor nodes can be continuously re-secured even in presence of an attacker who can read the memory of captured nodes.

...read moreread less

•Journal Article

A key management scheme for commodity sensor networks

Yong Ho Kim, +3 more

- 01 Jan 2005

- Lecture Notes in Computer Science

TL;DR: In this paper, a modified key distribution scheme was proposed for pairwise key establishment in sensor networks by Anderson, Chan, and Perrig, which does not require additional communication overhead nor additional infrastructure to load potential keys into sensor nodes.

...read moreread less

References

Proceedings Article•10.1145/586110.586117

A key-management scheme for distributed sensor networks

Laurent Eschenauer, +1 more

- 18 Nov 2002

TL;DR: A key-management scheme designed to satisfy both operational and security requirements of DSNs is presented, which relies on probabilistic key sharing among the nodes of a random graph and uses simple protocols for shared-key discovery and path-key establishment, and for key revocation, re-keying, and incremental addition of nodes.

...read moreread less

•Proceedings Article•10.1109/SECPRI.2003.1199337

Random key predistribution schemes for sensor networks

Haowen Chan, +2 more

- 11 May 2003

TL;DR: The random-pairwise keys scheme is presented, which perfectly preserves the secrecy of the rest of the network when any node is captured, and also enables node-to-node authentication and quorum-based revocation.

...read moreread less

3.2K

Proceedings Article•10.1145/948109.948119

Establishing pairwise keys in distributed sensor networks

Donggang Liu, +1 more

- 27 Oct 2003

TL;DR: In this paper, a general framework for establishing pairwise keys between sensors on the basis of a polynomial-based key predistribution protocol is presented, and two efficient instantiations of the general framework are presented: a random subset assignment key pre-distribution scheme and a grid-based pre-disposition scheme.

...read moreread less

1.7K

•Proceedings Article

A keymanagement scheme for distributed sensor networks

L. Eschenauer

- 01 Jan 2002

1.3K

Journal Article•10.1145/1053283.1053287

Establishing pairwise keys in distributed sensor networks

Donggang Liu, +2 more

- 01 Feb 2005

- ACM Transactions on Information and Syst...

TL;DR: A general framework for establishing pairwise keys between sensor nodes using bivariate polynomials is developed and an optimization technique for polynomial evaluation is presented, which can be applied efficiently in resource-constrained sensor networks.

...read moreread less

917

...

Expand

On Secrecy Amplification Protocols

Chat with Paper

AI Agents for this Paper

Most frequently asked questions

1. What are the contributions in "On secrecy amplification protocols" ?

Figures

Citations

Crowdsourced Security Reconstitution for Wireless Sensor Networks: Secrecy Amplification.

On Secrecy Amplification Protocols

Reconsidering Attacker Models in Ad-Hoc Networks

Adaptive Secrecy Amplification with Radio Channel Key Extraction

A key management scheme for commodity sensor networks

References

A key-management scheme for distributed sensor networks

Random key predistribution schemes for sensor networks

Establishing pairwise keys in distributed sensor networks

A keymanagement scheme for distributed sensor networks

Establishing pairwise keys in distributed sensor networks

Related Papers (5)

Efficient quantum-based security protocols for information sharing and data protection in 5G networks

Threshold cryptography in mobile ad hoc networks

On the practicality of cryptographic defenses against pollution attacks in wireless network coding

Practical and Provably Secure Three-Factor Authentication Protocol Based on Extended Chaotic-Maps for Mobile Lightweight Devices

Generalized public-key cryptography with tight security