Protocols for Secure Communication in Wireless Sensor Networks

More documents

Recommendations

Info

162 Chapter 6. Integrity-Preserving Communications 6.2.1 Protocol Description Consider the basic linear graph in figure 6.1 representing a simple sensor network. The solid edges between adjacent vertices represent physical communication links that are used for transmitting messages. This communication graph is obtained, for example, by constructing the routing graph used for geographic routing protocols such as GPSR [91]. For constructing such a graph, certain edges are removed from the full connectivity graph, which contains information about which nodes are reachable from which other nodes. This could mean that, in principle, S1 may be able to send a message directly to S3. However, for various reasons this link is not used. 1 Thus, S2 is a one-hop neighbour, while S3 is a two-hop neighbour of S1. S 1 S 2 S 3 S 4 Figure 6.1: A simple communication graph with interleaved security relationships The dashed edges represent pairwise shared keys. Together with the vertices, they form the authentication graph of the network. In the example, each node has a shared key with each node within its two-hop neighbourhood, i.e. with all of its one-hop and two-hop neighbours. The key shared between nodes Si and S j will be denoted as Ki j = Kji. It is relatively straightforward to set up such a setting using the techniques described in chapter 4. Whenever a message is forwarded along a communication path, it is being authenticated using these keys. There are two cases we have to consider, message creation and message relaying. Message creation When a message is generated from scratch, the source node creates k MACs targeted at the subsequent nodes on the path. As each of these nodes has a shared key with the source of the message, the authenticity of the message can be directly verified. For the first k hops on a path we can therefore speak of message authentication. If any of the first k−1 nodes tampers with the message, the following node will detect the manipulation based on the MAC from the source. 1 One of the reasons is energy efficiency. When transmitting a message from S1 to S3 via S2, both S1 and S2 can reduce their transmission power. In total, this saves energy compared to S1 directly sending to S3 with higher signal strength. Another reason is that geographic routing requires a planar communication graph.
6.2. Basic Interleaved Authentication 163 In our example, S1 creates a message M and two MACs {M}K12 and {M}K13 , and sends everything to S2. The message includes an identifier denoting its origin, S1 in this case. S2 uses this identifier to determine that it shares a key with the message source, and can therefore directly verify the authenticity of the message. S2 computes {M}K21 and checks that the result matches the respective value received from S1. As S2 has established the authenticity of the message, it creates two new MACs using its keys K23 and K24, and forwards them to S3 together with the message itself and the remaining MAC that was created by S1. Similarly, S3 checks that the MAC from the source is valid. The MAC {M}K23 provides no significant additional value beyond link authentication as S1 and S3 share a key anyway, and since S1 is the creator of the message, S3 does not require a “second opinion” on the validity of the message. Message forwarding A node that is too far away from the message source to share a key with it accepts a message only if it has k MACs from different nodes attached that the relaying node can verify. Since these MACs have been created not by the message source itself but by other relaying nodes, we call them attestations. If all attestations are verified correctly, the relaying node can be more or less sure that the message has not been tampered with. This belief is justified if there are not too many colluding compromised nodes. Under the assumption that key material has not been disclosed, all k attestating nodes would have to collaborate in order to convince the relaying node to accept a falsified message. In the example, S4 is the first node on the path that cannot verify the message’s authenticity directly but has to rely on attestations only. Both S2 and S3 have created such attestations for S4. If both can be verified, S4 assumes that the message is correct and creates attestations for S5 and S6. If both S2 and S3 are compromised, they can convince S4 to accept a message as originating from S1 even if they have altered the content of the message. There is no way for S4 to know what the original content has been as there is no direct channel between the source and S4. In this basic form, we call this authentication scheme k-Canvas or simply Canvas if the parameter k is known. In most examples throughout this work, we will use k = 2. The name has been chosen since the graphical representation of the scheme resembles the visual impression of a cut through a canvas fabric common in cloth manufacturing.
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:
Page 69 and 70:
Page 71 and 72:
2.9. Existing Approaches to Wireles
Page 73 and 74:
Page 75 and 76:
Page 77 and 78:
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 105 and 106:
Page 107 and 108:
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 115 and 116:
Page 117 and 118:
Page 119 and 120:
Page 121 and 122:
Page 123 and 124:
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: 6.2. Basic Interleaved Authenticati
Page 179 and 180: 6.2. Basic Interleaved Authenticati
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 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

You also want an ePaper? Increase the reach of your titles

Delete template?

Save as template?