Protocols for Secure Communication in Wireless Sensor Networks

More documents

Recommendations

Info

166 Chapter 6. Integrity-Preserving Communications Algorithm 4 canvas-accept(A,P,m,C) Global values: X: ID of current node k: Parameter of the Canvas schme Input: A: message source P: destination location m: message text C: authentication information, a set of tuples Output: Return true if Canvas authentication succeeds 1: if ∃(A,X,c,a) ∈ C then ⊲ Is there a MAC from the source? 2: b := {A,P,m,c}KXA 3: if a = b ∧ c > cAX then 4: cAX := c 5: return true 6: else 7: return false 8: end if 9: else 10: for i in {1,...,k} do ⊲ Otherwise, check attestations 11: if ∃V.(V,X,c,a) ∈ C ∧V ∈ neighbours(i) then 12: b := {A,P,m,c}KXV 13: if a = b ∨ c ≤ cV K then 14: return false 15: else 16: cV K := c 17: end if 18: else 19: return false 20: end if 21: end for 22: end if 23: return true M = 〈 flag, source, dest, data, mac 〉 flag DIRECT (marking a Canvas-authenticated message) source purported source node’s identifier dest destination specifier data data payload of the message mac Canvas message authentication codes Table 6.2: Canvas message format d distance function τ allowed acceptance distance from a destination δ allowed forwarding distance from destination Table 6.3: Auxiliary rule parameters
6.2. Basic Interleaved Authentication 167 Algorithm 5 canvas-auth(A,P,m,C) Global values: X: ID of current node k: Parameter of the Canvas schme Input: A: message source P: destination location m: message text C: authentication information Output: Return modified authentication information 1: C ′ := C \ {(_,X,_,_) ∈ C} ⊲ Remove all MACs for X 2: for i in {1...k} do 3: V := prefetch-hop(i) 4: cXV := cXV + 1 5: a := {A,P,m,cXV }KXV 6: C ′ := C ′ ∪ {(X,V,cXV ,a)} 7: end for 8: return C ′ The fundamental message acceptance rules for the Canvas authentication scheme are shown in Table 6.1. Messages are marked with flags that denote their type. Here, only type DIRECT is used, which indicates that the authentication of the message is completely handled locally, i.e. at each hop. Later, we will see another type, SHORTCUT, which extends the authentication of messages to larger distances. The format of messages is explained in Table 6.2. The destination location of a message is specified by geographic coordinates. Table 6.3 lists the remaining parameters that are being used in rules. The distance function d yields the geographic distance between a node and a location. τ is a global parameter that determines the acceptable deviation from the exact destination location. If a node is located within a range of τ from a destination location, this node is qualified to be the final receiver of a message. This means that this node will not further relay the message. It could, however, inform the nodes in its vicinity that it has received the message. There could be multiple nodes that are qualified to receive a message for a certain destination, and multiple messages addressed to the same destination could be received by different nodes. It is up to a higher system layer, such as a clustering protocol or the application itself, to coordinate the activities of all these nodes. Another global parameter denoting a geographic distance is δ. This parameter denotes the maximum distance over which Canvas-authenticated messages should be forwarded. If δ = ∞, there is no limit on that distance, and full reachability is maintained. For variations of the basic authentication scheme
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 127 and 128:
4.3. Key Agreement Based on Hash Ch
Page 129 and 130: 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 179: 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

Create successful ePaper yourself

Delete template?

Save as template?