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

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

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

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

this is the fraction of pairs of uncompromised nodes that can communicate securely.<br />

From the adversary’s po<strong>in</strong>t of view, this means that the adversary is<br />

able to manipulate a certa<strong>in</strong> fraction of the messages that are sent throughout<br />

the network.<br />

Note the difference between l<strong>in</strong>k and path security. L<strong>in</strong>k security prevents<br />

a passive adversary from read<strong>in</strong>g messages that are sent between two adjacent<br />

nodes. In case of an active adversary that operates only at the l<strong>in</strong>k level, l<strong>in</strong>k<br />

security prevents the adversary from manipulat<strong>in</strong>g messages. If the active adversary<br />

is also able to compromise nodes, l<strong>in</strong>k security is not sufficient to keep<br />

the adversary from eavesdropp<strong>in</strong>g or manipulation. In a multi-hop environment<br />

and an adversary of the latter k<strong>in</strong>d, l<strong>in</strong>k level security provides no protection<br />

aga<strong>in</strong>st this adversary. In this case, it is necessary to protect communication<br />

paths <strong>in</strong>stead of l<strong>in</strong>ks only. A path provides a connection between two nodes<br />

that are non-adjacent. All nodes on that path cooperate relay<strong>in</strong>g messages.<br />

There is a certa<strong>in</strong> level of trust that must be put <strong>in</strong>to them to provide the necessary<br />

protection.<br />

A live path is an end-to-end connection <strong>in</strong> which both endpo<strong>in</strong>ts are uncompromised.<br />

This is <strong>in</strong>dependent of the fact whether these nodes can communicate<br />

securely with each other or not. If they have a unique secret shared key,<br />

secure communication is possible <strong>in</strong>dependent of the number of compromised<br />

nodes that relay the messages. The shared key guarantees that <strong>in</strong>termediate<br />

nodes cannot tamper with the message. If the nodes use disjo<strong>in</strong>t multi-path<br />

rout<strong>in</strong>g, a shared secret key is not necessary, but there is a limit on the number<br />

of compromised paths that can be tolerated. Us<strong>in</strong>g a secret shar<strong>in</strong>g scheme, t<br />

out of n available paths may be compromised without affect<strong>in</strong>g the traffic.<br />

A functional path is a path that provides a secure connection between two<br />

uncompromised endpo<strong>in</strong>ts. If end-to-end security means are available, such as<br />

a shared key, any path that is alive is considered functional. Only its ability to<br />

relay messages is required. Security is provided by the shared secret key. If no<br />

end-to-end security means are available, the path itself is responsible <strong>for</strong> provid<strong>in</strong>g<br />

security properties. For example, <strong>in</strong> a hop-to-hop authentication scheme<br />

all nodes are trusted to relay a message untampered.<br />

For def<strong>in</strong><strong>in</strong>g a measure <strong>for</strong> the level of security, we consider the set of live<br />

paths as the basic reference. This seems sensible as the <strong>in</strong>tegrity of a path is<br />

irrelevant if one of the endpo<strong>in</strong>ts is compromised. Formally, we def<strong>in</strong>e as a<br />

measure <strong>for</strong> the security of a sensor network the quotient<br />

|{π ∈ Π : π is functional}|<br />

(3.1)<br />

|{π ∈ Π : π is alive}|<br />

where Π is the set of all paths (i.e., pairwise multi-hop connections) <strong>in</strong> the net-

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

Saved successfully!

Ooh no, something went wrong!