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-09-03 08:07] – [On Secrecy Amplification Protocols - WISTP2015] petrs | public:papers:wistp2015 [2016-12-01 13:28] (current) – external edit 127.0.0.1 | ||
---|---|---|---|
Line 6: | Line 6: | ||
* Conference page: [[http:// | * Conference page: [[http:// | ||
- | * Download paper: {{: | + | * Download |
* Download extended version of paper: {{: | * Download extended version of paper: {{: | ||
* Download presentation: | * Download presentation: | ||
Line 13: | Line 13: | ||
**Bibtex:** | **Bibtex:** | ||
| | ||
- | | + | |
title = {On Secrecy Amplification Protocols}, | title = {On Secrecy Amplification Protocols}, | ||
| | ||
Line 32: | Line 32: | ||
===== 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 turn provide secure link key to nodes with key compromised by an attacker. As wireless networks running on batteries are targeted, not only protocol' | + | 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 |
+ | |||
+ | //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 survey of all published secrecy amplification protocols (13 in total). | * Provided survey of all published secrecy amplification protocols (13 in total). | ||
+ | * Established upper bound of secrecy amplification protocol success rate for given network. | ||
* Compared protocols wrt message efficiency, number of links they are able to secure and other characteristics. | * Compared protocols wrt message efficiency, number of links they are able to secure and other characteristics. | ||
* Discussed how hard is to execute secrecy amplification protocol in practice on real node (TelosB, TinyOS). | * Discussed how hard is to execute secrecy amplification protocol in practice on real node (TelosB, TinyOS). | ||
Line 43: | Line 46: | ||
{{: | {{: | ||
- | //Figure showing increase in the number of secured links after SA protocols in the random | + | //Figure showing increase in the number of secured links after secrecy amplification |
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. |