Differences
This shows you the differences between two versions of the page.
Both sides previous revision Previous revision Next revision | Previous revision | ||
public:papers:wistp2015 [2015-08-25 12:10] – [On Secrecy Amplification Protocols - WISTP2015] petrs | public:papers:wistp2015 [2016-12-01 13:28] (current) – external edit 127.0.0.1 | ||
---|---|---|---|
Line 5: | Line 5: | ||
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 research questions.// | 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 research questions.// | ||
- | * Conference: [[http://www.wistp.org/ | + | * Conference |
- | * Download paper: {{: | + | * Download |
- | * Extended | + | * Download extended |
* Download presentation: | * Download presentation: | ||
- | * {{: | + | * Download used simulator and configuration files: |
**Bibtex:** | **Bibtex:** | ||
| | ||
- | | + | |
title = {On Secrecy Amplification Protocols}, | title = {On Secrecy Amplification Protocols}, | ||
| | ||
Line 24: | Line 24: | ||
| | ||
| | ||
+ | |||
+ | ---- | ||
+ | ---- | ||
===== What is this paper about? ===== | ===== What is this paper about? ===== | ||
+ | |||
+ | The secrecy amplification protocol provides description how messages with a fresh key material should be propagated inside a target network to provide secure link key to nodes with key currently compromised by an attacker. As wireless networks running on batteries are targeted, not only protocol' | ||
+ | |||
+ | //A secrecy amplification protocol can be pretty effective: a network with 50-70 % of compromised links can be turned into network with 95+ % secure links for the price of small hundreds of messages (per node) in only tens of seconds.// | ||
**In this we paper, we:** | **In this we paper, we:** | ||
- | * gave motivation, why secrecy amplification protocols should be used -- if enough neighbours are available in network and random compromise pattern is assumed, network with only 30 % secure can be turned into network with more then 95 % secure links. | + | * Gave motivation, why secrecy amplification protocols should be used -- if enough neighbours are available in network and random compromise pattern is assumed, network with only 30 % secure can be turned into network with more then 95 % secure links. |
- | * provided | + | * Provided |
- | * compared | + | * Established upper bound of secrecy amplification protocol success rate for given network. |
- | * discussed | + | * Compared |
- | * introduced | + | * Discussed |
+ | * Introduced | ||
{{: | {{: | ||
- | Increase | + | //Figure showing increase |
compromise pattern on network with 20.3 legal neighbours on average. With in- | compromise pattern on network with 20.3 legal neighbours on average. With in- | ||
creasing number of neighbouring nodes the general effectiveness of protocol grows. | creasing 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 | As can be seen, a strong majority of secure links (> 90%) can be obtained even | ||
- | when the initial network had 80% of compromised links. | + | when the initial network had 70% of compromised links.// |
{{: | {{: | ||
- | Increase | + | //Figure showing increase |