Download Now Free registration required
The authors show that two distinguishing properties of sensor networks, i.e., the presence of a trusted base station, and the pre-knowledge of the fixed network topology, can yield security protocols that are both communication-efficient and highly general. They show new protocols for broadcast authentication, credential dissemination and node-to-node signatures. For securing in-network distributed computations, they show an algorithm for securely computing the sum of sensor readings in the network, which they can generalize to tree computations for any combination of continuous real-valued functions. Each of these primitives involves per-node communication costs that scale logarithmically with the number of nodes in the network, do not require public key cryptography, and are secure against arbitrary coalitions of malicious nodes.
- Format: PDF
- Size: 1493.5 KB