Summary: Abstract--A challenge in resource-constrained networks is
to provide secure communication in an efficient manner. In
this paper, we present a simple protocol for secret
maintenance between a pair of network neighbors. We prove
that Dolev Yao model based adversaries cannot compromise
the current secret shared by the neighbors. Moreover, we
show that if the current secret between the pair is somehow
disclosed, previous secrets are not compromised nor can
future secrets be compromised.
Index Terms--Computer network security, Network fault
tolerance, Network reliability, Protocols.
basic step in providing secure communication in a
network despite the activity of intruders is to empower
authentic network entities with secrets. In this paper we
address the problem of maintaining secrets in resource-
constrained networks, e.g. sensor networks.
Desired properties of secret maintenance in resource-
constrained networks are forward secrecy, backward
secrecy, scalability, tolerance to loss of synchronization,