Protocols for Secure Communication in Wireless Sensor Networks

More documents

Recommendations

Info

106 Chapter 4. Key Establishment mined as common keys cannot be selected again. Thus, there are S−i ways to select those remaining 2(m − i) keys. 2(m−i) • These 2(m − i) keys have to be distributed among the two nodes. Since each node gets m − i keys, there are 2(m−i) m−i ways to do that. • The denominator equals the total number of possibilities to select two key rings. Two nodes can establish a link key if they share sufficiently many root keys. For the q-composite schemes, q keys are required. The basic scheme requires one common key, thus its connectivity equals that of the q = 1 composite scheme. It is therefore sufficient to give the connectivity of the q-composite schemes, which is determined as Connectivity 1 0.9 0.8 0.7 0.6 0.5 0.4 0.3 0.2 0.1 0 q−1 pc = 1 − ∑ i=0 Pr[i shared] . (4.2) 0 10000 20000 30000 40000 50000 60000 70000 80000 90000 100000 Key pool size q=1 q=2 q=3 Figure 4.1: Connectivity depending on key pool size. A key ring size of 200 is assumed Figure 4.1 shows the connectivity depending on the size of the key pool for the q-composite schemes for a fixed key ring size. The larger the key pool is chosen, the smaller the connectivity will be. Additionally, the connectivity
4.2. Random Key Pre-Distribution 107 degrades more steeply the more root keys are required to set up a link key. This behaviour is, of course, expected, since the likelihood that a pair of nodes has q common root keys gets smaller with increasing q. 4.2.7 Resilience Against Link Key Compromise Our attacker model assumes that if a node is compromised, the adversary gains complete access to the key material stored in that node. By collecting the key material of various compromised nodes, the adversary may gather a significant fraction of the key pool. He might then be able to recover the link key established between a pair of uncompromised nodes. This would allow the adversary to eavesdrop on the communication between the nodes (if the link key is used for encryption) or to inject messages into the network with a faked origin (if the link key is used for authentication). As the attack parameter, we consider the number x of captured nodes. All root keys from these nodes are available to the adversary. We denote the probability with which a link key can be reconstructed from this collected key material as pκ. Under the basic scheme, a link key is derived from exactly one root key. The probability that this key is known to another node is m S . Therefore, when faced with x compromised nodes, the probability that at least one of them has knowledge of that key is pκ = 1 − 1 − m x (4.3) S Assuming the q-composite scheme, the probability that two nodes can establish a link key is given by pc. The probability that a link key is being derived from i root keys is (i ≥ q): Pr[i shared] pc In accordance to the reasoning above, the expected fraction of root keys being compromised is 1−(1− m S )x . If i keys were involved in deriving a link key, the probability that this link is compromised is (1 − (1 − m S )x ) i as all involved root keys have to be compromised. When x nodes have been captured, the probability that a link key between two uncompromised nodes is being compromised is therefore [39]: p q κ = m ∑ 1 − 1 − i=q m xi Pr[i shared] S pc (4.4) These measures of resilience show that these schemes reveal information about the whole network to an adversary who captures a fixed number of nodes.
Page 1:
Diss. ETH Nr. 18174 Protocols for S
Page 4 and 5:
ii often ad hoc and transient natur
Page 6 and 7:
iv Dieses Ziel kann durch kryptogra
Page 9 and 10:
Contents 1 Introduction 1 1.1 Backg
Page 11 and 12:
Contents ix 3.3.1 Basic Assumptions
Page 13 and 14:
Contents xi 6.3 Performance Evaluat
Page 15 and 16:
Chapter 1 Introduction 1.1 Backgrou
Page 17 and 18:
1.3. Contributions 3 on the other h
Page 19 and 20:
1.4. Thesis Outline 5 • Mario Str
Page 21 and 22:
Chapter 2 Wireless Sensor Networks
Page 23 and 24:
2.1. Applications of Wireless Senso
Page 25 and 26:
2.1. Applications of Wireless Senso
Page 27 and 28:
2.2. Sensor Node Characteristics 13
Page 29 and 30:
Page 31 and 32:
Page 33 and 34:
Page 35 and 36:
2.3. Related Network Types 21 zero,
Page 37 and 38:
2.3. Related Network Types 23 • P
Page 39 and 40:
2.3. Related Network Types 25 PAN,
Page 41 and 42:
2.4. Related Device Types 27 in con
Page 43 and 44:
2.4. Related Device Types 29 ports
Page 45 and 46:
2.5. Sensor Network Models 31 both
Page 47 and 48:
2.5. Sensor Network Models 33 are a
Page 49 and 50:
2.6. Simulation of Sensor Networks
Page 51 and 52:
Page 53 and 54:
Page 55 and 56:
2.7. Security Requirements 41 terac
Page 57 and 58:
2.7. Security Requirements 43 netwo
Page 59 and 60:
2.7. Security Requirements 45 acces
Page 61 and 62:
2.7. Security Requirements 47 2.7.6
Page 63 and 64:
2.7. Security Requirements 49 of te
Page 65 and 66:
2.8. Cryptography for Sensor Networ
Page 67 and 68:
2.8. Cryptography for Sensor Networ
Page 69 and 70: 2.8. Cryptography for Sensor Networ
Page 71 and 72: 2.9. Existing Approaches to Wireles
Page 79 and 80: Chapter 3 A Security Model for Wire
Page 81 and 82: 3.1. Attack Paths 67 field (cf. [17
Page 83 and 84: 3.1. Attack Paths 69 modules [63].
Page 85 and 86: 3.1. Attack Paths 71 closed environ
Page 87 and 88: 3.2. Attack Objectives 73 • Timel
Page 89 and 90: 3.2. Attack Objectives 75 Critical
Page 91 and 92: 3.2. Attack Objectives 77 Actors A
Page 93 and 94: 3.3. Adversary Characteristics 79 a
Page 95 and 96: 3.3. Adversary Characteristics 81 c
Page 97 and 98: 3.3. Adversary Characteristics 83 p
Page 99 and 100: 3.4. The Cost of End-to-End Securit
Page 101 and 102: 3.4. The Cost of End-to-End Securit
Page 103 and 104: 3.5. Approximating End-to-End Secur
Page 109 and 110: 3.7. Summary 95 Location-constraine
Page 111 and 112: Chapter 4 Key Establishment Shared
Page 113 and 114: 4.2. Random Key Pre-Distribution 99
Page 119: 4.2. Random Key Pre-Distribution 10
Page 125 and 126: 4.3. Key Agreement Based on Hash Ch
Page 131 and 132: 4.4. Multiple Hash Chains for Key A
Page 133 and 134: 4.4. Multiple Hash Chains for Key A
Page 135 and 136: 4.5. Strengthening Random Key Pre-D
Page 137 and 138: 4.6. Related Work 123 pc = 0.33 Du-
Page 139 and 140: 4.6. Related Work 125 Probability o
Page 141 and 142: 4.7. Summary 127 The security of th
Page 143 and 144: Chapter 5 Multipath Communication T
Page 145 and 146: 5.1. Principles of Multipath Commun
Page 147 and 148: 5.2. Routing on Spanning Trees 133
Page 155 and 156: 5.3. Properties of Tree Paths 141 b
Page 157 and 158: 5.3. Properties of Tree Paths 143 a
Page 159 and 160: 5.3. Properties of Tree Paths 145 n
Page 161 and 162: 5.3. Properties of Tree Paths 147 F
Page 163 and 164: 5.3. Properties of Tree Paths 149 D
Page 165 and 166: 5.4. Security Evaluation 151 compro
Page 167 and 168: 5.5. Related Work 153 width usage a
Page 169 and 170: 5.5. Related Work 155 separation. F
Page 171 and 172:
Chapter 6 Integrity-Preserving Comm
Page 173 and 174:
6.1. Authentication and Integrity P
Page 175 and 176:
6.2. Basic Interleaved Authenticati
Page 177 and 178:
Page 179 and 180:
Page 181 and 182:
Page 183 and 184:
Page 185 and 186:
Page 187 and 188:
Page 189 and 190:
6.3. Performance Evaluation 175 A B
Page 191 and 192:
6.3. Performance Evaluation 177 We
Page 193 and 194:
6.4. Security Evaluation 179 Bandwi
Page 195 and 196:
6.4. Security Evaluation 181 a sens
Page 197 and 198:
6.4. Security Evaluation 183 Number
Page 199 and 200:
6.4. Security Evaluation 185 We ass
Page 201 and 202:
6.4. Security Evaluation 187 Paths
Page 203 and 204:
6.4. Security Evaluation 189 ity of
Page 205 and 206:
6.4. Security Evaluation 191 of the
Page 207 and 208:
6.4. Security Evaluation 193 The se
Page 209 and 210:
6.5. Extended Interleaved Authentic
Page 211 and 212:
Page 213 and 214:
Page 215 and 216:
Page 217 and 218:
Page 219 and 220:
Page 221 and 222:
6.6. Comparing Interleaved and Mult
Page 223 and 224:
6.7. Applications 209 Psi 1 0.8 0.6
Page 225 and 226:
6.7. Applications 211 codes are att
Page 227 and 228:
6.7. Applications 213 domain. The r
Page 229 and 230:
6.9. Summary 215 simulations and by
Page 231 and 232:
Chapter 7 Conclusion This work prop
Page 233 and 234:
7.1. Secure Communication in Wirele
Page 235 and 236:
7.2. Future Work 221 7.1.4 Shortcut
Page 237 and 238:
Bibliography [1] Specification of t
Page 239 and 240:
Bibliography 225 1st European Works
Page 241 and 242:
Bibliography 227 [41] Rohan Chitrad
Page 243 and 244:
Bibliography 229 [64] L. Eschenauer
Page 245 and 246:
Bibliography 231 [85] Yahoo! Inc. D
Page 247 and 248:
Bibliography 233 [105] Kristof Van
Page 249 and 250:
Bibliography 235 [126] Anne Marie M
Page 251 and 252:
Bibliography 237 [150] Sylvia Ratna
Page 253 and 254:
Bibliography 239 [172] Thanos Stath
Page 255 and 256:
Bibliography 241 [192] Eric W. Weis
Page 257:
Curriculum Vitae Harald Vogt Person
show all

Protocols for Secure Communication in Wireless Sensor Networks

Create successful ePaper yourself

Delete template?

Save as template?