21.08.2013 Views

Protocols for Secure Communication in Wireless Sensor Networks

Protocols for Secure Communication in Wireless Sensor Networks

Protocols for Secure Communication in Wireless Sensor Networks

SHOW MORE
SHOW LESS

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

76 Chapter 3. A Security Model <strong>for</strong> <strong>Wireless</strong> <strong>Sensor</strong> <strong>Networks</strong><br />

Messages <strong>Wireless</strong> radio communication is based on a shared medium, which<br />

makes it easy <strong>for</strong> a passive attacker to overhear the traffic <strong>in</strong> a network. Sometimes,<br />

directed radio l<strong>in</strong>ks or optical communication make eavesdropp<strong>in</strong>g harder,<br />

but a determ<strong>in</strong>ed attacker is likely to be able to record all traffic. Ultimately,<br />

the confidentiality of messages can only be preserved through encryption. Sett<strong>in</strong>g<br />

up keys <strong>for</strong> secur<strong>in</strong>g po<strong>in</strong>t-to-po<strong>in</strong>t l<strong>in</strong>ks is a well-understood problem. In<br />

sensor networks, key agreement schemes as described <strong>in</strong> chapter 4 can be used.<br />

This renders pure passive attacks more or less useless. Still, it might be possible<br />

to extract useful <strong>in</strong><strong>for</strong>mation from the traffic patterns that occur <strong>in</strong> the network.<br />

Of course, l<strong>in</strong>k-level encryption is not able to effectively hide the content<br />

of messages from an active attacker. All messages received by compromised<br />

nodes can be read by the attacker. In a strong sense, the only way to preserve<br />

confidentiality is end-to-end encryption. The same applies to message authentication<br />

(and thus <strong>in</strong>tegrity): only if there is a common cryptographic context<br />

between the sender and the receiver, the orig<strong>in</strong> of a message can be verified <strong>in</strong> a<br />

strong sense. However, due to the resource restrictions that apply to sensor networks,<br />

end-to-end security may not be a practical approach. Other approaches<br />

that approximate the properties of end-to-end security are the ma<strong>in</strong> topic of this<br />

thesis.<br />

In a large sensor network, messages often have to be transmitted over several<br />

l<strong>in</strong>ks until they arrive at their dest<strong>in</strong>ation. Generally, we can not assume<br />

a common cryptographic context between the sender and the dest<strong>in</strong>ation. It is<br />

there<strong>for</strong>e possible that a compromised node changes the contents of a message<br />

it is relay<strong>in</strong>g. Such changes could be detected by nodes that overhear the <strong>in</strong>com<strong>in</strong>g<br />

and outgo<strong>in</strong>g messages. However, these potential guards may be asleep<br />

at that time. L<strong>in</strong>k-level encryption makes overhear<strong>in</strong>g <strong>in</strong>effective as well. We<br />

propose <strong>in</strong>terleaved authentication (see chapter 6) to this end.<br />

The <strong>in</strong>jection of fabricated messages is another way of manipulat<strong>in</strong>g the<br />

operation of a sensor network. If a node emits messages <strong>in</strong> its own name, it<br />

may not be possible <strong>for</strong> other nodes to decide whether these messages are the<br />

product of correct operation, or if they are <strong>for</strong>ged. Certa<strong>in</strong> <strong>in</strong>trusion detection<br />

techniques may be able to isolate such nodes if their behaviour deviates significantly<br />

from ord<strong>in</strong>ary operation. Alternatively, nodes may <strong>for</strong>ge messages and<br />

attach a different ID as their orig<strong>in</strong> to them. This attack is commonly called<br />

spoof<strong>in</strong>g. If the used ID does not exist, this behaviour is subject to detection if<br />

the ID is challenged. If the ID exists and another, non-compromised node with<br />

the same ID exists <strong>in</strong> the network, it may raise an alarm if it detects a message<br />

that was sent by the malicious node.

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!